Related papers: Lattices with Symmetry
We generalize the polynomial-time solvability of $k$-\textsc{Diverse Minimum s-t Cuts} (De Berg et al., ISAAC'23) to a wider class of combinatorial problems whose solution sets have a distributive lattice structure. We identify three…
A periodic lattice in Euclidean 3-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…
If L is an order polynomially complete lattice, (that is: every monotone function from L^n to L is induced by a lattice-theoretic polynomial) then the cardinality of L is a strongly inaccessible cardinal. In particular, the existence of…
This is an expository paper intended to introduce the polynomial time lattice basis reduction algorithm first described by Arjen Lenstra, Hendrik Lenstra, and L\'aszl\'o Lov\'asz in 1982. We begin by introducing the shortest vector problem,…
This article builds on Thurston's height functions. His tiling algorithm is reinterpreted using lattice theory and then generalized in order to generate any tiling of a hole-free region. Combined with a natural encoding of tilings by words,…
It is old folklore that the violation of Leibniz rule on a lattice is an obstruction for constructing a lattice supersymmetric model. While it is still true for full supersymmetry, we show that a slightly modified form of the Leibniz rule,…
We show that the process of spontaneous symmetry breaking can trap a field theoretic system in a highly non-trivial state containing a lattice of domain walls. In one large compact space dimension, a lattice is inevitably formed. In two…
We present efficient algorithms for detecting central and mirror symmetry for the case of algebraic curves defined by means of polynomial parametrizations. The algorithms are based on the existence of a linear relationship between two…
Two-dimensional lattices provide the arena for many physics problems of essential importance, a non-trivial symmetry in such lattices will help to reveal the underlying physics. Whether there is a directional scaling for the 2D lattices is…
Lattice rules are among the most prominently studied quasi-Monte Carlo methods to approximate multivariate integrals. A rank-1 lattice rule to approximate an $s$-dimensional integral is fully specified by its generating vector $\mathbf{z}…
We give a generalisation of the Lenstra-Lenstra-Lov\'asz (LLL) lattice-reduction algorithm that is valid for an arbitrary (split, semisimple) reductive group $G$. This can be regarded as `lattice reduction with symmetries'. We make this…
Within random matrix theory, the statistics of the eigensolutions depend fundamentally on the presence (or absence) of time reversal symmetry. Accepting the Bohigas-Giannoni-Schmit conjecture, this statement extends to quantum systems with…
We discuss the possibility of the existence of finite algorithms that may give distinct knot classes. In particular we present two attempts for such algorithms which seem promising, one based on knot projections on a plane, the other on…
After mentioning some of the difficulties arising in lattice gauge theory from chiral symmetry, I discuss one of the recent attempts to resolve these issues using fermionic surface states in an extra space-time dimension. This picture can…
An effective way to design structured coherent wave interference patterns that builds on the theory of coherent lattices, is presented. The technique combines prime number factorization in the complex plane with moir\'e theory to provide a…
Symmetry breaking for graphs and other combinatorial objects is notoriously hard. On the one hand, complete symmetry breaks are exponential in size. On the other hand, current, state-of-the-art, partial symmetry breaks are often considered…
We provide an introduction to recent lattice formulations of supersymmetric theories which are invariant under one or more real supersymmetries at nonzero lattice spacing. These include the especially interesting case of ${\cal N}=4$ SYM in…
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 investigate the problem of computing tensor product multiplicities for complex semisimple Lie algebras. Even though computing these numbers is #P-hard in general, we show that if the rank of the Lie algebra is assumed fixed, then there…
The main result of the paper is the first polynomial-time algorithm for ranking bracelets. The time-complexity of the algorithm is O(k^2 n^4), where k is the size of the alphabet and n is the length of the considered bracelets. The key part…