Related papers: Strongly Reduced Lattice Bases
General arguments related to ``triviality'' predict that, in the broken phase of $(\lambda\Phi^4)_4$ theory, the condensate $<\Phi>$ re-scales by a factor $Z_{\phi}$ different from the conventional wavefunction-renormalization factor,…
We construct an $\ll^2$-solution (also known as a weakly low solution) to ${\mathrm{D}^2}$ within ${\mathrm{B}\Sigma^0_{3}}$ and prove the $\ll^2$-basis theorem for $\mathrm{RT}^2$ over ${\mathrm{B}\Sigma^0_{3}}$. The $\ll^2$-basis theorem…
We complete the construction of raising and lowering operators, given in a previous work, for the orthogonal polynomials of hypergeometric type on non-homogeneous lattice, and extend these operators to the generalized orthogonal…
Let $L$ be a finite lattice and let $I$ be an ideal of $L$. Then the restriction map is a bounded lattice homomorphism of the congruence lattice of~$L$ into the congruence lattice of $I$. In a 2009 paper, the authors proved the converse. In…
This paper studies the differential lattice, defined to be a lattice $L$ equipped with a map $d:L\to L$ that satisfies a lattice analog of the Leibniz rule for a derivation. Isomorphic differential lattices are studied and classifications…
After a pedagogical introduction to the calculation of weak matrix elements on the lattice, I review some of the lattice's most recent predictions concerning the weak decays of $B$-mesons. Amongst the topics covered are the determinations…
We define a notion of a weak canonical base for a partial type. This notion is weaker than the usual canonical base for an amalgamation base. We prove that certain family of partial types have a weak canonical base. This family clearly…
We show that for those lattices of Voronoi's first kind, a vector of shortest nonzero Euclidean length can computed in polynomial time by computing a minimum cut in a graph.
We describe and motivate a proposed new approach to lowerbounding the circuit complexity of boolean functions, based on a new formalization of "patterns" as elements of a special basis of the vector space of all truth table properties. We…
This paper describes the formal verification of NP-hardness reduction functions of two key problems relevant in algebraic lattice theory: the closest vector problem and the shortest vector problem, both in the infinity norm. The…
The notions of weak and strong minimizability of a matrix intertwining operator are introduced. Criterion of strong minimizability of a matrix intertwining operator is revealed. Criterion and sufficient condition of existence of a constant…
We find sharp absolute constants $C_1$ and $C_2$ with the following property: every well-rounded lattice of rank 3 in a Euclidean space has a minimal basis so that the solid angle spanned by these basis vectors lies in the interval…
For $A\in\mathbb{Z}^{m\times n}$ we investigate the behaviour of the number of lattice points in $P_A(b)=\{x\in\mathbb{R}^n:Ax\leq b\}$, depending on the varying vector $b$. It is known that this number, restricted to a cone of constant…
In this paper we revisit the problem of computing the closure of a set of attributes given a basis of dependencies or implications. This problem is of main interest in logics, in the relational database model, in lattice theory, and in…
We study the behavior of $h$-vectors associated to matroid complexes under weak maps, or inclusions of matroid polytopes. Specifically, we show that the $h$-vector of the order complex of the lattice of flats of a matroid is component-wise…
In this short note we give incremental algorithms for the following lattice problems: finding a basis of a lattice, computing the successive minima, and determining the orthogonal decomposition. We prove an upper bound for the number of…
A variant of the flatness problem from integer programming is studied, in which one considers convex bodies in $\mathbb{R}^d$ with at most $k$ interior lattice points. The maximum lattice width of such a body is denoted by Flt(d,k) and it…
We study the problem of enumerating Tarski fixed points on finite lattices. We derive query complexity lower bounds for finding three or more Tarski fixed points of isotone maps and the subclasses of increasing and decreasing isotone maps.…
A structure of a complete lattice (in the sense of a poset) is defined on the underlying set of the orhtogonal group of a real Euclidean space, by a construction analogous to that of the weak order of a Coxeter system in terms of its root…
Continuous reducibilities are a proven tool in computable analysis, and have applications in other fields such as constructive mathematics or reverse mathematics. We study the order-theoretic properties of several variants of the two most…