Related papers: Dualization in lattices given by implicational bas…
In topological data analysis, two-parameter persistence can be studied using the representation theory of the 2d commutative grid, the tensor product of two Dynkin quivers of type A. In a previous work, we defined interval approximations…
Ballistic deposition is one of the many models of interface growth that are believed to be in the KPZ universality class, but have so far proved to be largely intractable mathematically. In this model, blocks of size one fall independently…
We show that any two frames in a separable Hilbert space that are dual to each other have the same excess. Some new relations for the analysis resp. synthesis operators of dual frames are also derived. We then prove that pseudo-dual frames…
We consider the problem of dualizing a monotone CNF (equivalently, computing all minimal transversals of a hypergraph), whose associated decision problem is a prominent open problem in NP-completeness. We present a number of new polynomial…
Geometrical constraints imposed on higher dimensional harmonic lattices generally lead to nonlinear dynamical lattice models. Helical lattices obtained by such a procedure are shown to be described by sine- plus linear-lattice equations.…
We consider the problem of interpolating functions partially defined over a distributive lattice, by means of lattice polynomial functions. Goodstein's theorem solves a particular instance of this interpolation problem on a distributive…
The Congruence Lattice Problem (CLP), stated by R. P. Dilworth in the forties, asks whether every distributive {∨, 0}-semilatticeS is isomorphic to the semilattice Conc L of compact congruences of a lattice L. While this problem is…
We undertake a detailed study of the $L^2$ discrepancy of rational and irrational 2-dimensional lattices either with or without symmetrization. We give a full characterization of lattices with optimal $L^2$ discrepancy in terms of the…
A complex Hilbert space of dimension six supports at least three but not more than seven mutually unbiased bases. Two computer-aided analytical methods to tighten these bounds are reviewed, based on a discretization of parameter space and…
For a positive integer $s$, a lattice $L$ is said to be $s$-integrable if $\sqrt{s}\cdot L$ is isometric to a sublattice of $\mathbb{Z}^n$ for some integer $n$. Conway and Sloane found two minimal non $2$-integrable lattices of rank $12$…
We present several sparsification lower and upper bounds for classic problems in graph theory and logic. For the problems 4-Coloring, (Directed) Hamiltonian Cycle, and (Connected) Dominating Set, we prove that there is no polynomial-time…
A prismatoid is a polytope with all its vertices contained in two parallel facets, called its bases. Its width is the number of steps needed to go from one base to the other in the dual graph. The author recently showed in arXiv:1006.2814…
Each finite algebra $\mathbf A$ induces a lattice~$\mathbf L_{\mathbf A}$ via the quasi-order~$\to$ on the finite members of the variety generated by~$\mathbf A$, where $\mathbf B \to \mathbf C$ if there exists a homomorphism from $\mathbf…
A vertical 2-sum of a two-coatom lattice $L$ and a two-atom lattice $U$ is obtained by removing the top of $L$ and the bottom of $U$, and identifying the coatoms of $L$ with the atoms of $U$. This operation creates one or two nonisomorphic…
When we deal with a matroid ${\mathcal M}=(U,{\mathcal I})$, we usually assume that it is implicitly given by means of the independence (IND) oracle. Time complexity of many existing algorithms is polynomially bounded with respect to $|U|$…
We study the computational complexity of satisfiability problems for classes of simple finite height (ortho)complemented modular lattices $L$. For single finite $L$, these problems are shown tobe $\mc{NP}$-complete; for $L$ of height at…
This is a continuation of the early paper concerning matroid base polytope decomposition. Here, we will present sufficient conditions on $M$ so its base matroid polytope $P(M)$ has a {\em sequence} of hyperplane splits. The latter yields to…
In this paper we study the {\it bilinear assignment problem} (BAP) with size parameters $m$ and $n$, $m\leq n$. BAP is a generalization of the well known quadratic assignment problem and the three dimensional assignment problem and hence…
This work is an extention of Shiraishi and Matsumoto [10], and discusses the computational complexity of the long-term average of local observables in one-dimensional lattices with shift-invariant nearest-neighbor interactions for simple…
Extended formulations are an important tool in polyhedral combinatorics. Many combinatorial optimization problems require an exponential number of inequalities when modeled as a linear program in the natural space of variables. However, by…