Related papers: Designs, groups and lattices
We generalize the prior linked symplectic Grassmannian construction, applying it to to prove smoothing results for rank-2 limit linear series with fixed special determinant on chains of curves. We apply this general machinery to prove new…
A certain family of orthogonal groups (called "Clifford groups" by G. E. Wall) has arisen in a variety of different contexts in recent years. These groups have a simple definition as the automorphism groups of certain generalized…
A $k$-regular graph is called a divisible design graph (DDG for short) if its vertex set can be partitioned into $m$ classes of size $n$, such that two distinct vertices from the same class have exactly $\lambda_1$ common neighbors, and two…
Any configuration of lattice vectors gives rise to a hierarchy of higher-dimensional configurations which generalize the Lawrence construction in geometric combinatorics. We prove finiteness results for the Markov bases, Graver bases and…
In this paper we establish a fundamental structural result for formal series encoding the total non-archimedean masses of quadratic lattices of varying determinant squareclasses, but with fixed rank $n$ and signature over any fixed number…
In this paper, we explain a simple and uniform construction of a smooth integral model associated to a quadratic, (anti)-hermitian, and (anti)-quaternionic hermitian lattice defined over an arbitrary local field. As one major application,…
We construct lattices with alternating kinks and anti-kinks. The lattice is shown to be stable in certain models. We consider the forces between kinks and antikinks and find that the lattice dynamics is that of a Toda lattice. Such lattices…
We introduce the concepts of complex Grassmannian codes and designs. Let G(m,n) denote the set of m-dimensional subspaces of C^n: then a code is a finite subset of G(m,n) in which few distances occur, while a design is a finite subset of…
The space of matrices of positive determinant GL^+_n inherits an extrinsic metric space structure from R^{n^2}. On the other hand, taking the infimum of the lengths of all paths connecting two points in GL^+_n gives an intrinsic metric. We…
We investigate the local and global dynamics of two 1-Dimensional (1D) Hamiltonian lattices whose inter-particle forces are derived from non-analytic potentials. In particular, we study the dynamics of a model governed by a "graphene-type"…
Lattice models, for their coarse-grained nature, are best suited for the study of the ``designability problem'', the phenomenon in which most of the about 16,000 proteins of known structure have their native conformations concentrated in a…
In this paper, we investigate pattern avoidance of parity restricted (even or odd) Grassmannian permutations for patterns of sizes 3 and 4. We use a combination of direct counting and bijective techniques to provide recurrence relations,…
Recent results on the linearity of braid groups are extended in two ways. We generalize the Lawrence Krammer representation as well as Krammer's faithfulness proof for this linear representation to Artin groups of finite type.
We study the existence of lattices in almost abelian Lie groups that admit left invariant locally conformal K\"ahler or locally conformal symplectic structures in order to obtain compact solvmanifolds equipped with these geometric…
Applying Feynman diagrammatics to non-fermionic strongly correlated models with local constraints might seem generically impossible for two separate reasons: (i) the necessity to have a Gaussian (non-interacting) limit on top of which the…
We prove two results concerning an Ulam-type stability problem for homomorphisms between lattices. One of them involves estimates by quite general error functions; the other deals with approximate (join) homomorphisms in terms of certain…
Poset-theoretic generalizations of set-theoretic committee constructions are presented. The structure of the corresponding subposets is described. Sequences of irreducible fractions associated to the principal order ideals of finite bounded…
We give several characterizations of order continuous vector lattice homomorphisms between Archimedean vector lattices. We reduce the proofs of some of the equivalences to the case of composition operators between vector lattices of…
We consider Euclidean lattices spanned by images of algebraic conjugates of an algebraic number under Minkowski embedding, investigating their rank, properties of their automorphism groups and sets of minimal vectors. We are especially…
In this paper, the 3-rank of the incidence matrices of 2-designs supported by the minimum weight codewords in a family of ternary linear codes considered in [C. Ding, C. Li, Infinite families of 2-designs and 3-designs from linear codes,…