Related papers: The Shadow Theory of Modular and Unimodular Lattic…
The notion of almost everywhere convergence has been generalized to vector lattices as unbounded order convergence, which proves a very useful tool in the theory of vector and Banach lattices. In this short note, we establish some new…
We give an explicit formula to express the weight of $2$-reflective modular forms. We prove that there is no $2$-reflective lattice of signature $(2,n)$ when $n\geq 15$ and $n\neq 19$ except the even unimodular lattices of signature…
For every natural number $n\geq 5$, we prove that the number of subuniverses of an $n$-element lattice is $2^n$, $13\cdot 2^{n-4}$, $23\cdot 2^{n-5}$, or less than $23\cdot 2^{n-5}$. By a subuniverse, we mean a sublattice or the emptyset.…
Estimating the number of vertices of a two dimensional projection, called a shadow, of a polytope is a fundamental tool for understanding the performance of the shadow simplex method for linear programming among other applications. We prove…
Spacetimes obtained by dimensional reduction along lattices containing a lightlike direction can admit semigroup extensions of their isometry groups. We show by concrete examples that such a semigroup can exhibit a natural order, which in…
In this paper, we propose novel methods for constructing uninorms using two comparable closure operators or, alternatively, two comparable interior operators on bounded lattices. These methods are developed under the necessary and…
The objective of this paper is to determine the lattices of minimal covolume in SL_n(R), for n greater than 3. The answer turns out to be the simplest one: SL_n(Z) is, up to automorphism, the unique lattice of minimal covolume in SL_n(R).…
We formulate supersymmetric Euclidean spacetime Ad* lattices whose classical continuum limits are U(N) supersymmetric Yang-Mills theories with sixteen supercharges in d=1,2,3 and 4 dimensions. This family includes the especially interesting…
We consider the lattice of supercharacter theories, in the sense of Diaconis and Isaacs, of the cyclic group of order n. We find necessary and sufficient conditions on n for that lattice to be upper or lower semimodular.
We use theta series and modular forms to prove that Z^n is the only integral unimodular lattice of rank n without characteristic vectors of norm <n, i.e. the only integral unimodular lattice not containing a vector w such that (w,w)<n and…
We construct several families of perfect sublattices with minimum $4$ of $\mathbb Z^d$. In particular, the number of $d-$dimensional perfect integral lattices with minimum $4$ grows faster than $d^k$ for every exponent $k$.
The consistency problem for a class of algebraic structures asks for an algorithm to decide for any given conjunction of equations whether it admits a non-trivial satisfying assignment within some member of the class. By Adyan (1955) and…
Let $L$ be an integral lattice in the Euclidean space $\mathbb{R}^n$ and $W$ an irreducible representation of the orthogonal group of $\mathbb{R}^n$. We give an implemented algorithm computing the dimension of the subspace of invariants in…
In this paper, we further investigate new construction methods for uninorms on bounded lattices via given uninorms. More specifically, we first construct new uninorms on arbitrary bounded lattices by extending a given uninorm on a…
Given a lattice $\Lambda$ in a locally compact abelian group $G$ and a measurable subset $\Omega$ with finite and positive measure, then the set of characters associated to the dual lattice form a frame for $L^2(\Omega)$ if and only if the…
For an input graph $G$, an additive spanner is a sparse subgraph $H$ whose shortest paths match those of $G$ up to small additive error. We prove two new lower bounds in the area of additive spanners: 1) We construct $n$-node graphs $G$ for…
By definition, a rigid graph in $\mathbb{R}^d$ (or on a sphere) has a finite number of embeddings up to rigid motions for a given set of edge length constraints. These embeddings are related to the real solutions of an algebraic system.…
A periodic lattice in Euclidean space is the infinite set of all integer linear combinations of basis vectors. Any lattice can be generated by infinitely many different bases. This ambiguity was only partially resolved, but standard…
We provide new conditions under which the alternating projection sequence converges in norm for the convex feasibility problem where a linear subspace with finite codimension $N\geq 2$ and a lattice cone in a Hilbert space are considered.…
E. Bayer-Fluckiger gave a necessary and sufficient condition for a polynomial to be realized as the characteristic polynomial of a semisimple isometry of an even unimodular lattice, by describing the local-global obstruction, and the author…