Related papers: Simple proofs for lattice coverings and sparse ten…
In this paper, we prove that the set of triangulations of a polygon can be equipped with an order to become a lattice. First, we define this order. In [HN99], authors defined the flip operator and then prove some properties of the graph of…
In this paper, we show that for each lattice basis, there exists an equivalent basis which we describe as ``strongly reduced''. We show that bases reduced in this manner exhibit rather ``short'' basis vectors, that is, the length of the…
Two simple ways to identify and explain fake Lax pairs are provided. The two methods are complementary, one involves finding a gauge transformation which can be used to remove the associated nonlinear system's dependent variable(s) from a…
In this paper, we propose non-commutative analogues of infimum and supremum with the help of algebraic orthogonality.
First a few reformulations of Frankl's conjecture are given, in terms of reduced families or matrices, or analogously in terms of lattices. These lead naturally to a stronger conjecture with a neat formulation which might be easier to…
We study simplicity of Lie skew braces from both global and infinitesimal perspectives. After reviewing the correspondence between connected Lie skew braces, simply transitive affine actions, and post-Lie algebras, we investigate ideals and…
Utilizing a picture of string and string spinors, we show a simpler version of staggered action. The advantage of this action is that in this action there always exist pair of quarks with different masses.
We present a short elementary proof of the following Twelve Points Theorem: Let M be a convex polygon with vertices at the lattice points, containing a single lattice point in its interior. Denote by m (resp. m*) the number of lattice…
An important conjecture in additive combinatorics, number theory, and algebraic geometry posits that the partition rank and analytic rank of tensors are equal up to a constant, over any finite field. We prove the conjecture up to a…
In a recent paper, G. Cz\'edli and E.\,T. Schmidt present a structure theorem for planar semimodular lattices. In this note, we present an alternative proof.
We review principal results on axiomatizability of classes of lattices of equivalences
We give necessary and sufficient conditions for an integral polynomial without linear factors to be the characteristic polynomial of an isometry of some even, unimodular lattice of given signature. This gives rise to Hasse principle…
We present an elementary proof concerning reciprocal transmittances and reflectances. The proof is direct, simple, and valid for the diverse objects that can be absorptive and induce diffraction and scattering, as long as the objects…
In this paper, we present a method to certify the approximation quality of a low rank tensor to a given third order symmetric tensor. Under mild assumptions, best low rank approximation is attained if a control parameter is zero or…
We present a simple and clear foundation for finite inference that unites and significantly extends the approaches of Kolmogorov and Cox. Our approach is based on quantifying lattices of logical statements in a way that satisfies general…
We consider complete lattices equipped with preorderings indexed by the ordinals less than a given (limit) ordinal subject to certain axioms. These structures, called stratified complete lattices, and weakly monotone functions over them,…
This paper studies the stability of tensor ranks under field extensions. Our main contributions are fourfold: (1) We prove that the analytic rank is stable under field extensions. (2) We establish the equivalence between the partition rank…
Tensor completion is a natural higher-order generalization of matrix completion where the goal is to recover a low-rank tensor from sparse observations of its entries. Existing algorithms are either heuristic without provable guarantees,…
Knecht considers the enumeration of coronas. This is a counting problem for two specific types of lozenge tilings. Their exact closed formulas are conjectured in [A380346] and [A380416] on the OEIS. We prove this conjecture by using the…
We consider the problem of determining the symmetric tensor rank for symmetric tensors with an algebraic geometry approach. We give algorithms for computing the symmetric rank for $2\times ... \times 2$ tensors and for tensors of small…