Related papers: Equivariant lattice generators and Markov bases
In the representation theory of simple Lie algebras, we consider the problem of constructing a monomial basis in an arbitrary irreducible finite-dimensional highest weight module. We construct a PBW-type basis in every finite-dimensional…
Word metrics on finitely generated groups have canonical quasi-isometry classes, making quasi-isometry invariants genuine group invariants. Rosendal generalized this phenomenon to topological groups through CB-generation, but in the general…
We prove that a connected, locally finite, quasi-transitive graph which is quasi-isometric to a planar graph is necessarily accessible. This leads to a complete classification of the finitely generated groups which are quasi-isometric to…
We use the lcm-lattice of a monomial ideal to study its minimal free resolutions. A new concept called a Taylor basis of a minimal free resolution is introduced and then used throughout the paper. We give a method of constructing minimal…
Totally symmetric sets are a recently introduced tool for studying homomorphisms between groups. In this paper, we give full classifications of totally symmetric sets in certain families of groups and bound their sizes in others. As a…
We give a combinatorial description (including explicit differential-form bases) for the cohomology groups of the space of n distinct nonzero complex numbers, with coefficients in rank-one local systems which are of finite monodromy around…
New series of $2^{2m}$-dimensional universally strongly perfect lattices $\Lambda_I $ and $\Gamma_J $ are constructed with $$2BW_{2m} ^{\#} \subseteq \Gamma _J \subseteq BW_{2m} \subseteq \Lambda _I \subseteq BW _{2m}^{\#} .$$ The lattices…
It is shown that there exist finitely generated infinite simple groups of infinite commutator width and infinite square width on which there exists no stably unbounded conjugation-invariant norm, and in particular stable commutator length…
In this paper, we consider the mixed tensor space of a $G$-graded vector space where $G$ is a finite abelian group. We obtain a spanning set of invariants of the associated symmetric algebra under the action of a color analogue of the…
The simplicial wedge construction on simplicial complexes and simple polytopes has been used by a variety of authors to study toric and related spaces, including non-singular toric varieties, toric manifolds, intersections of quadrics and…
The configuration of a matroid $M$ is the abstract lattice of cyclic flats (flats that are unions of circuits) where we record the size and rank of each cyclic flat, but not the set. One can compute the Tutte polynomial of $M$, and stronger…
This work concerns the study of properties of a group of Koszul algebras coming from the toric ideals of a chordal bipartite infinite family of graphs (alternately, these rings may be interpreted as coming from determinants of certain…
We develop a theory of average sizes of kernels of generic matrices with support constraints defined in terms of graphs and hypergraphs. We apply this theory to study unipotent groups associated with graphs. In particular, we establish…
This paper surveys and illustrates geometric methods for constructing normal bases allowing efficient finite field arithmetic. These bases are constructed using the additive group, the multiplicative group and the Lucas torus. We describe…
For a natural class of $r \times n$ integer matrices, we construct a non-convex polytope which periodically tiles $\mathbb R^n$. From this tiling, we provide a family of geometrically meaningful maps from a generalized sandpile group to a…
Linear codes are widely studied in coding theory as they have nice applications in distributed storage, combinatorics, lattices, cryptography and so on. Constructing linear codes with desirable properties is an interesting research topic.…
Associated to any hypergraph is a toric ideal encoding the algebraic relations among its edges. We study these ideals and the combinatorics of their minimal generators, and derive general degree bounds for both uniform and non-uniform…
We describe birational representations of discrete groups generated by involutions, having their origin in the theory of exactly solvable vertex-models in lattice statistical mechanics. These involutions correspond respectively to two kinds…
We study degree bounds on rational but not necessarily polynomial generators for the field $\mathbf{k}(V)^G$ of rational invariants of a linear action of a finite abelian group. We show that lattice-theoretic methods used recently by the…
Generating trees are a useful technique in the enumeration of various combinatorial objects, particularly restricted permutations. Quite often the generating tree for the set of permutations avoiding a set of patterns requires infinitely…