Related papers: Orbits in Lattices
We consider the lattice of coarse structures on a set $X$ and study metrizable, locally finite and cellular coarse structures on $X$ from the lattice point of view.
A method of embedding partially ordered sets into linear spaces is presented. The problem of finding all orthocomplementations in a finite lattice is reduced to a linear programming problem.
We elaborate on the notion of a filtration of an operad defined in terms of a lattice-valued operad serving as an indexing object. That covers ordinary integer-indexed filtrations of associative algebras and operads as a special case, yet…
We consider two group actions on $m$-tuples of $n \times n$ matrices. The first is simultaneous conjugation by $\operatorname{GL}_n$ and the second is the left-right action of $\operatorname{SL}_n \times \operatorname{SL}_n$. We give…
A procedure for the construction and the classification of multilattices in arbitrary dimension is proposed. The algorithm allows to determine explicitly the location of the points of a multilattice given its space group, and to determine…
It is widely understood that the quotient space of a topological group action can have a complicated combinatorial structure, indexed somehow by the sotropy groups of the action, but how best to record this structure seems unclear. This…
We define and count lattice points in the moduli space of stable genus g curves with n labeled points. This extends a construction of the second author for the uncompactified moduli space. The enumeration produces polynomials with top…
Computational problems concerning the orbit of a point under the action of a matrix group occur throughout computer science, including in program analysis, complexity theory, quantum computation, and automata theory. In many cases the focus…
We show that one can use model categories to construct rational orthogonal calculus. That is, given a continuous functor from vector spaces to based spaces one can construct a tower of approximations to this functor depending only on the…
Given a discrete lattice, $\Gamma < \operatorname{SL}_m(\mathbb{R})$, and a base point $o \in \mathbb{R}^m$, let $N_\Gamma(T)$ denote the number of points in the orbit $o \cdot \Gamma $ whose (Euclidean) length is bounded by a growing…
In this short note we give incremental algorithms for the following lattice problems: finding a basis of a lattice, computing the successive minima, and determining the orthogonal decomposition. We prove an upper bound for the number of…
We provide an algorithm to compute generators of the orthogonal group of the discriminant group associated to an integral quadratic lattice over the integers. We give a closed formula for its order.
We show that, if the family \cal{O} of orbits of all vector fields on a subcartesian space P is locally finite and each orbit in \cal{O} is locally closed, then \cal{O} defines a smooth Whitney A stratification of P. We also show that the…
We introduce the concept of a bounded below set in a lattice. This can be used to give a generalization of Rota's broken circuit theorem to any finite lattice. We then show how this result can be used to compute and combinatorially explain…
Let \Gamma be a lattice in G=SL(n,R) and X=G/S a homogeneous space of G, where S is a closed subgroup of G which contains a real algebraic subgroup H such that G/H is compact. We establish uniform distribution of orbits of \Gamma in X…
Consider an homogeneous space under a locally compact group G and a lattice in G. Then the lattice naturally acts on the homogeneous space. Looking at a dense orbit, one may wonder how to describe its repartition. One then adopt a dynamical…
As an abstraction and generalization of the integral operator in analysis, integral operators (known as Rota-Baxter operators of weight zero) on associative algebras and Lie algebras have played an important role in mathematics and physics.…
Let K be a number field, let A be a finite dimensional semisimple K-algebra and let Lambda be an O_K-order in A. It was shown in previous work that, under certain hypotheses on A, there exists an algorithm that for a given (left)…
We provide an algorithm for computing an effective basis of homology of elliptic surfaces over the complex projective line on which integration of periods can be carried out. This allows the heuristic recovery of several algebraic…
We study the moduli space of triples $(C, L_1, L_2)$ consisting of quartic curves $C$ and lines $L_1$ and $L_2$. Specifically, we construct and compactify the moduli space in two ways: via geometric invariant theory (GIT) and by using the…