Related papers: Beck's Conjecture For Multiplicative Lattices
This note reformulates certain classical combinatorial duality theorems in the context of order lattices. For source-target networks, we generalize bottleneck path-cut and flow-cut duality results to edges with capacities in a distributive…
Theorem. Let $\pi$ be a finite group of order $n$, $R$ be a Dedekind domain satisfying that (i) $\fn{char}R=0$, (ii) every prime divisor of $n$ is not invertible in $R$, and (iii) $p$ is unramified in $R$ for any prime divisor $p$ of $n$.…
We explore the relationship between lattice field theory and graph theory, placing special emphasis on the interplay between Dirac and scalar lattice operators and matrices within the realm of spectral graph theory. Beyond delving into…
We explain why naive discretization results that have appeared in [hep-lat/0006013] do not appear to yield the desired continuum limit. The fermion propagator on the lattice inevitably yields a diagram with nonvanishing UV degree D=0…
This paper has two objectives. First, we study lattices with skew-Hermitian forms over division algebras with positive involutions. For division algebras of Albert types I and II, we show that such a lattice contains an "orthogonal" basis…
We study lattices acting on $\mathrm{CAT}(0)$ spaces via their commensurated subgroups. To do this we introduce the notions of a graph of lattices and a complex of lattices giving graph and complex of group splittings of $\mathrm{CAT}(0)$…
Recently, Baker and Norine have proven a Riemann-Roch theorem for finite graphs. We extend their results to metric graphs and thus establish a Riemann-Roch theorem for divisors on (abstract) tropical curves.
A recent conjecture by C. Carlet on the sum-freedom of the binary multiplicative inverse function can be stated as follows: For each pair of positive integers $(n,k)$ with $3\le k\le n-3$, there is a $k$-dimensional $\Bbb F_2$-subspace $E$…
The goal of this paper is to prove that several variants of deciding whether a poset can be (weakly) embedded into a small Boolean lattice, or to a few consecutive levels of a Boolean lattice, are NP-complete, answering a question of Griggs…
We define and study multiplicative connections in the tangent bundle of a Lie groupoid. Multiplicative connections are linear connections satisfying an appropriate compatibility with the groupoid structure. Our definition is natural in the…
Motivated by the study of a certain family of classical geometric problems we investigate the existence of multiplicative connections on proper Lie groupoids. We show that one can always deform a given connection which is only approximately…
This paper is concerned with discrete, uniform subgroups (lattices) of oscillator groups, which are certain semidirect products of the Heisenberg group and the additive group of real numbers. The present paper rectifies the uncertainties in…
We prove an identity for five arguments, valid in the lattice of natural numbers with gcd and lcm as lattice operations. More generally, this identity characterizes arbitrary distributive lattices. Fixing three of the five arguments, we…
In a recent work, Keusch proved the so-called 1-2-3 Conjecture, raised by Karo\'nski, {\L}uczak, and Thomason in 2004: for every connected graph different from $K_2$, we can assign labels~$1,2,3$ to the edges so that no two adjacent…
Convex semilattices are algebras that are at the same time a convex algebra and a semilattice, together with a distributivity axiom. These algebras have attracted some attention in the last years as suitable algebras for probability and…
For a rank two root system and a pair of nonnegative integers, using only elementary combinatorics we construct two posets. The constructions are uniform across the root systems A1+A1, A2, C2, and G2. Examples appear in Figures 3.2 and 3.3.…
In this paper we prove a generalization of famous Larchr's theorem concerning good lattice points.
In 1988, I. Beck introduced the notion of a zero-divisor graph of a commutative rings with $1$. There have been several generalizations in recent years. In particular, in 2007 J. Coykendall and J. Maney developed the irreducible divisor…
Assuming the Gowers Inverse conjecture and the M\"{o}bius conjecture for the finite parameter $s$, Green-Tao verified Dickson's conjecture for lattices which are ranges of linear maps of complexity at most $s$. In this paper, we reformulate…
The number of $n \times n$ matrices whose entries are either -1, 0, or 1, whose row- and column- sums are all 1, and such that in every row and every column the non-zero entries alternate in sign, is proved to be $[1!4! >...…