Related papers: Meeting Covered Elements in $\nu$-Tamari Lattices
A lattice is a partially-ordered set in which every pair of elements has a unique meet (greatest lower bound) and join (least upper bound). We present new data structures for lattices that are simple, efficient, and nearly optimal in terms…
We propose a new lattice superfield formalism in momentum representation which accommodates species doublers of the lattice fermions and their bosonic counterparts as super multiplets. We explicitly show that one dimensional N=2 model with…
Atomically thin metallenes have emerged as a new member of the two-dimensional (2D) materials family. Recent experimental realization of metallenes in the {\AA}ngstr\"om limit has further intensified interest in this class of 2D materials.…
Photonic modes exhibiting a polarization winding akin to a vortex possess an integer topological charge. Lasing with topological charge 1 or 2 can be realized in periodic lattices of up to six-fold rotational symmetry. Higher order charges…
A polynomial optimization problem (POP) asks for minimizing a polynomial function given a finite set of polynomial constraints (equations and inequalities). This problem is well-known to be hard in general, as it encodes many hard…
We study a class of rearrangement problems under a novel pick-n-swap prehensile manipulation model, in which a robotic manipulator, capable of carrying an item and making item swaps, is tasked to sort items stored in lattices of variable…
Recent advanced experimental implementations of optical lattices with highly tunable geometry open up new regimes for quantum many-body states of matter that previously had not been accessible. Here we introduce a symmetry-based method of…
We consider two sequences of orthogonal polynomials $(P_n)_{n\geq 0}$ and $(Q_n)_{n\geq 0}$ with respect regular functionals ${\bf u}$ and ${\bf v}$, respectively. We assume that $$\sum_{j=1} ^{M} a_{j,n}\mathrm{D}_x ^k P_{k+n-j}…
Let M be a module over a commutative ring and let Spec(M) (resp. Max(M)) be the collection of all prime (resp. maximal) submodules of M. We topologize Spec(M) with Zariski topology, which is analogous to that for Spec(R), and consider…
A new matrix product, called the semi-tensor product (STP), is briefly reviewed. The STP extends the classical matrix product to two arbitrary matrices. Under STP the set of matrices becomes a monoid (semi-group with identity). Some related…
Suppose L and M are full-rank lattices in Euclidean space, such that vol(L) < vol(M). Answering a question of Han and Wang from 2001, we show how to construct a bounded measurable set F (we can even take F to be a finite union of polytopes)…
Coverage path planning is a major application for mobile robots, which requires robots to move along a planned path to cover the entire map. For large-scale tasks, coverage path planning benefits greatly from multiple robots. In this paper,…
We give a novel algorithm for enumerating lattice points in any convex body, and give applications to several classic lattice problems, including the Shortest and Closest Vector Problems (SVP and CVP, respectively) and Integer Programming…
The lattice superalgebra of the link approach is shown to satisfy a Hopf algebraic supersymmetry where the difference operator is introduced as a momentum operator. The breakdown of the Leibniz rule for the lattice difference operator is…
An n-dimensional polytope P^n is called simple if exactly n codimension-one faces meet at each vertex. The lattice of faces of a simple polytope P^n with m codimension-one faces defines an arrangement of even-dimensional planes in R^{2m}.…
We study a natural generalization of stable matching to the maximum weight stable matching problem and we obtain a combinatorial polynomial time algorithm for it by reducing it to the problem of finding a maximum weight ideal cut in a DAG.…
For a partially ordered set P, we denote by Co(P) the lattice of order-convex subsets of P. We find three new lattice identities, (S), (U), and (B), such that the following result holds. Theorem. Let L be a lattice. Then L embeds into some…
Skyrmions--topologically protected nanoscale spin textures with vortex-like configurations--hold transformative potential for ultra-dense data storage, spintronics and quantum computing. However, their practical utility is challenged by…
This paper is a slightly extended version of the talk I gave at the Open Problems in Algebraic Combinatorics conference at the University of Minnesota in May 2022. We introduce two strict order relations on lattice paths and formulate…
We consider the problem of Data Flow Analysis over monotone data flow frameworks with a finite lattice. The problem of computing the Maximum Fixed Point (MFP) solution is shown to be P-complete even when the lattice has just four elements.…