Transitive Group Action Research Articles

Computing a group action from the class field theory of imaginary hyperelliptic function fields

We explore algorithmic aspects of a simply transitive commutative group action coming from the class field theory of imaginary hyperelliptic function fields. Namely, the Jacobian of an imaginary hyperelliptic curve defined over Fq acts on a subset of isomorphism classes of Drinfeld modules. We describe an algorithm to compute the group action efficiently. This is a function field analog of the Couveignes-Rostovtsev-Stolbunov group action. We report on an explicit computation done with our proof-of-concept C++/NTL implementation; it took a fraction of a second on a standard computer. We prove that the problem of inverting the group action reduces to the problem of finding isogenies of fixed τ-degree between Drinfeld Fq[X]-modules, which is solvable in polynomial time thanks to an algorithm by Wesolowski. We give asymptotic complexity bounds for all algorithms presented in this paper.

Tracking control on homogeneous spaces: the Equivariant Regulator (EqR)

Accurate tracking of planned trajectories in the presence of perturbations is an important problem in control and robotics. Symmetry is a fundamental mathematical feature of many dynamical systems and exploiting this property offers the potential of improved tracking performance. In this paper, we investigate the tracking problem for input-affine systems on homogeneous spaces: manifolds which admit symmetries with transitive group actions. We show that there is natural manner to lift any desired trajectory of such a system to a lifted trajectory on the symmetry group. This construction allows us to define a global tracking error and apply LQR design to obtain an approximately optimal control in a single coordinate chart. The resulting control is then applied to the original plant and shown to yield excellent tracking performance. We term the resulting design methodology the Equivariant Regulator (EqR). We provide an example input-affine system posed on a homogeneous space, derive the trajectory linearisation in error coordinates and demonstrate the effectiveness of EqR compared to standard approaches in simulation.

Kasteleyn cokernels and perfect matchings on planar bipartite graphs

The determinant method of Kasteleyn gives a method of computing the number of perfect matchings of a planar bipartite graph. In addition, results of Bernardi exhibit a bijection between spanning trees of a planar bipartite graph and elements of its Jacobian. In this paper, we explore an adaptation of Bernardi’s results, providing a simply transitive group action of the Kasteleyn cokernel of a planar bipartite graph on its set of perfect matchings, when the planar bipartite graph in question is of the form $$G^+$$ , as defined by Kenyon, Propp and Wilson.

Spaces of Bounded Measurable Functions Invariant under a Group Action

In this paper, we characterize spaces of L∞-functions on a compact Hausdorff space that are invariant under a transitive and continuous group action. This work is analogous to established results concerning invariant spaces of continuous and measurable functions on a compact Hausdorff space. The case for L∞-functions cannot be proved in the same way when endowed with the norm-topology, but a similar argument can be used when the space of L∞-functions is given the weak*-topology, as we show in this paper.

Reconstructing a minimal topological dynamical system from a set of return times

AbstractWe investigate to what extent a minimal topological dynamical system is uniquely determined by a set of return times to some open set. We show that in many situations, this is indeed the case as long as the closure of this open set has no non-trivial translational symmetries. For instance, we show that under this assumption, two Kronecker systems with the same set of return times must be isomorphic. More generally, we show that if a minimal dynamical system has a set of return times that coincides with a set of return times to some open set in a Kronecker system with translationarily asymmetric closure, then that Kronecker system must be a factor. We also study similar problems involving nilsystems and polynomial return times. We state a number of questions on whether these results extend to other homogeneous spaces and transitive group actions, some of which are already interesting for finite groups.

A unified FFT-based approach to maximum assignment problems related to transitive finite group actions

This paper studies the cross-correlation of two real-valued functions whose common domain is a set on which a finite group acts transitively. Such a group action generalizes, e.g., circular time shifts for discrete periodic time signals or spatial translations in the context of image processing. Cross-correlations can be reformulated as convolutions in group algebras and are thus transformable into the spectral domain via Fast Fourier Transforms. The resulting general discrete cross-correlation theorem will serve as the basis for a unified FFT-based approach to maximum assignment problems related to transitive finite group actions. Our main focus is on those assignment problems arising from the actions of symmetric groups on the cosets of Young subgroups. The “simplest” nontrivial representatives of the latter class of problems are the NP-hard symmetric and asymmetric maximum quadratic assignment problem. We present a systematic spectral approach in terms of the representation theory of symmetric groups to solve such assignment problems. This generalizes and algorithmically improves Kondor's spectral branch-and-bound approach (SODA, 2010) to the exact solution of the asymmetric maximum quadratic assignment problem.

Classification of transitive group actions

<p style='text-indent:20px;'>We investigate systematically several topological transitivity and mixing concepts for group actions via weak disjointness, return time sets and topological complexity functions.</p>

Optimized CSIDH Implementation Using a 2-Torsion Point

The implementation of isogeny-based cryptography mainly use Montgomery curves, as they offer fast elliptic curve arithmetic and isogeny computation. However, although Montgomery curves have efficient 3- and 4-isogeny formula, it becomes inefficient when recovering the coefficient of the image curve for large degree isogenies. Because the Commutative Supersingular Isogeny Diffie-Hellman (CSIDH) requires odd-degree isogenies up to at least 587, this inefficiency is the main bottleneck of using a Montgomery curve for CSIDH. In this paper, we present a new optimization method for faster CSIDH protocols entirely on Montgomery curves. To this end, we present a new parameter for CSIDH, in which the three rational two-torsion points exist. By using the proposed parameters, the CSIDH moves around the surface. The curve coefficient of the image curve can be recovered by a two-torsion point. We also proved that the CSIDH while using the proposed parameter guarantees a free and transitive group action. Additionally, we present the implementation result using our method. We demonstrated that our method is 6.4% faster than the original CSIDH. Our works show that quite higher performance of CSIDH is achieved while only using Montgomery curves.

On some Ternary Linear Codes and Designs obtained from the Projective Special Linear Goup PSL3(4)

Let (G, ∗) be a group and X any set, an action of a group G on X, denoted as G×X → X, (g, x) 7→ g.x, assigns to each element in G a transformation of X that is compatible with the group structure of G. If G has a subgroup H then there is a transitive group action of G on the set (G/H) of the right co-sets of H by right multiplication. A representation of a group G on a vector space V carries the dimension of the vector space. Now, given a field F and a finite group G, there is a bijective correspondence between the representations of G on the finitedimensional F-vector spaces and finitely generated FG-modules. We use the FG -modules to construct linear ternary codes and combinatorial designs from the permutation representations of the group L3(4). We investigate the properties and parameters of these codes and designs.
 We further obtain the lattice structures of the sub-modules and compare these ternary codes with the binary codes constructed from the same group.

Encoding musical procedures by sequential transducers

The aim of this paper is to establish the interconnection between musical functions and sequential transducers, thus enabling to transform musical properties into machine structural properties. Simply transitive left group actions deriving from generalized interval systems as well as musical metre partitioning and group preference rules , are investigated in the proposed setup.

Boundary Representations of \u03bb-Harmonic and Polyharmonic Functions on Trees

On a countable tree T, allowing vertices with infinite degree, we consider an arbitrary stochastic irreducible nearest neighbour transition operator P. We provide a boundary integral representation for general eigenfunctions of P with eigenvalue λ ∈ C. This is possible whenever λ is in the resolvent set of P as a self-adjoint operator on a suitable ℓ2-space and the diagonal elements of the resolvent (“Green function”) do not vanish at λ. We show that when P is invariant under a transitive (not necessarily fixed-point-free) group action, the latter condition holds for all λ≠ 0 in the resolvent set. These results extend and complete previous results by Cartier, by Figà-Talamanca and Steger, and by Woess. For those eigenvalues, we also provide an integral representation of λ-polyharmonic functions of any order n, that is, functions f: T to mathbb {C} for which (λ ⋅ I − P)nf = 0. This is a far-reaching extension of work of Cohen et al., who provided such a representation for the simple random walk on a homogeneous tree and eigenvalue λ = 1. Finally, we explain the (much simpler) analogous results for “forward only” transition operators, sometimes also called martingales on trees.

Extension of transitive actions of Lie groups

We give an algebraic construction of extensions of arbitrary transitive actions of soluble Lie groups on compact manifolds. The question of the possible dimensions of such extensions is studied in detail. We also consider some generalizations of this construction and the question of constructing extended transitive Lie group actions in some particular cases.

Convolution of valuations on manifolds

We introduce the new notion of convolution of a (smooth or generalized) valuation on a group $G$ and a valuation on a manifold $M$ acted upon by the group. In the case of a transitive group action, we prove that the spaces of smooth and generalized valuations on $M$ are modules over the algebra of compactly supported generalized valuations on $G$ satisfying some technical condition of tameness. The case of a vector space acting on itself is studied in detail. We prove explicit formulas in this case and show that the new convolution is an extension of the convolution on smooth translation invariant valuations introduced by J. Fu and the second named author.

Approximation in mean on homogeneous compact spaces

Jackson’s type theorem on approximation of square integrable functions is proved for functions defined on homogeneous spaces with a compact transitive transformation group actions. An example is proved which illustrates the theorem.

Symmetric unique neighbor expanders and good LDPC codes

An infinite family of bounded-degree ‘unique-neighbor’ expanders was constructed explicitly by Alon and Capalbo (2002). We present an infinite family F of bounded-degree unique-neighbor expanders with the additional property that every graph in the family F is a Cayley graph. This answers a question raised by Tali Kaufman. Using the same methods, we show that the symmetric LDPC codes constructed by Kaufman and Lubotzky (2012) are in fact symmetric under a simply transitive group action on coordinates.

The Connes–Consani plane connection

Inspired by a recent paper of Alain Connes and Caterina Consani which connects the geometric theory surrounding the elusive field with one element to sharply transitive group actions on finite and infinite projective spaces (“Singer actions”), we consider several fundamental problems and conjectures about Singer actions. Among other results, we show that virtually all infinite abelian groups and all (possibly infinitely generated) free groups act as Singer groups on certain projective planes, as a corollary of a general criterion. We investigate for which fields F the plane P2(F)=PG(2,F) (and more generally the space Pn(F)=PG(n,F)) admits a Singer group, and show, e.g., that for any prime p and any positive integer n>1, PG(n,Fp‾) cannot admit Singer groups (Fp‾ an algebraic closure of Fp). One of the main results in characteristic 0, which is a corollary of a criterion which applies to many other fields, is that PG(m,R) with m≠0 a positive even integer, cannot admit Singer groups.

Ergodicity of non-uniformly expanding transitive group (or semigroup) actions

In this paper, we prove that every non-uniformly expanding transitive group (or semigroup) action of C1+α conformal local diffeomorphisms of a compact manifold is ergodic with respect to the Lebesgue measure.

Optimal measurements for symmetric quantum states with applications to optical communication

The minimum probability of error (MPE) measurement discriminates between a set of candidate quantum states with the minimum average error probability allowed by quantum mechanics. Conditions for a measurement to be MPE were derived by Yuen, Kennedy and Lax (YKL). MPE measurements have been found for states that form a single orbit under a group action, i.e., there is a transitive group action on the states in the set. For such state sets, termed geometrically uniform (GU) by Forney, it was shown that the `pretty good measurement' (PGM) attains the MPE. Even so, evaluating the actual probability of error (and other performance metrics) attained by the PGM on a GU set involves inverting large matrices, and is not easy in general. Our first contribution is a formula for the MPE and conditional probabilities of GU sets, using group representation theory. Next, we consider sets of pure states that have multiple orbits under the group action. Such states are termed compound geometrically uniform (CGU). MPE measurements for general CGU sets are not known. In this paper, we show how our representation-theoretic description of optimal measurements for GU sets naturally generalizes to the CGU case. We show how to compute the MPE measurement for CGU sets by reducing the problem to solving a few simultaneous equations. The number of equations depends on the sizes of the multiplicity space of irreducible representations. For many common group representations (such as those of several practical good linear codes), this is much more tractable than solving large semi-definite programs---which is what is needed to solve the YKL conditions numerically for arbitrary state sets. We show how to evaluate MPE measurements for CGU states for some examples relevant to quantum-limited classical optical communication.

Convex-transitive Douglas algebras

The convex-transitivity property can be seen as a convex generalization of the almost transitive (or quasi-isotropic) group action of the isometry group of a Banach space on its unit sphere. We will show that certain Banach algebras, including conformal invariant Douglas algebras, are weak-star convex-transitive. Geometrically speaking, this means that the investigated spaces are highly symmetric. Moreover, it turns out that the symmetry property is satisfied by using only 'inner' isometries, i.e. a subgroup consisting of isometries which are homomorphisms on the algebra. In fact, weighted composition operators arising from function theory on the unit disk will do. Some interesting examples are provided at the end.

Toward a classification of real compact solvmanifolds with real symplectic structures

In this paper, we deal with the problem of classifying compact complex solvmanifolds with holomorphic symplectic structures and obtain some structure results which make the classification possible. In particular, we reduce the classification to the nilpotent case with the same dimension, which we call the nilpotent reduction. The same method also works for the real compact solvmanifolds with real symplectic structures. The real six-dimensional case was treated completely. This is one of the major steps to obtain further examples of compact holomorphic symplectic manifolds. For example, the Kodaira–Thurston surface is NOT a complex homogeneous manifold with a transitive Lie group action which keeps the complex structure invariant, but a real solvmanifold with a complex structure.