Related papers: Recurrent Theme of Pick's Theorem
We study a lattice point counting problem for a class of families of domains in a Euclidean space. This class consists of anisotropically expanding bounded domains, which remain unchanged along some fixed linear subspace and expand in…
Radical binomial ideals associated with finite lattices are studied. Gr\"obner basis theory turns out to be an efficient tool in this investigation.
In a capacitated directed graph, it is known that the set of all min-cuts forms a distributive lattice [1], [2]. Here, we describe this lattice as a regular predicate whose forbidden elements can be advanced in constant parallel time after…
We discuss continued fractions on real quadratic number fields of class number 1. If the field has the property of being 2-stage euclidean, a generalization of the euclidean algorithm can be used to compute these continued fractions.…
For a certain family of complete modular lattices, we prove a Jordan--H\"older--Scheier-like" theorem with no assumptions on cardinality or well-orderedness. This family includes both lattices which are both join- and meet-continuous, as…
Elementary proofs of unique factorization in rings of arithmetic functions using a simple variant of Euclid's proof for the fundamental theorem of arithmetic.
We present a polynomial partitioning theorem for finite sets of points in the real locus of an irreducible complex algebraic variety of codimension at most two. This result generalizes the polynomial partitioning theorem on the Euclidean…
Starting from an extension of the Poisson bracket structure and Kubo-Martin-Schwinger-property of classical statistical mechanics of continuous systems to spin systems, defined on a lattice, we derive a series of, as we think, new and…
We introduce in this paper two dimensional lattice models whose continuum limit belongs to the $N=2$ series. The first kind of model is integrable and obtained through a geometrical reformulation, generalizing results known in the $k=1$…
We study enumerations of Dyck and ballot tilings, which are tilings of a region determined by two Dyck or ballot paths. We give bijective proofs to two formulae of enumerations of Dyck tilings through Hermite histories. We show that one of…
Using Euler's formula for a network of polygons for 2D case (or polyhedra for 3D case), we show that the number of dynamic\textit{\}degrees of freedom of the electric field equals the number of dynamic degrees of freedom of the magnetic…
We investigate cut-elimination and cut-simulation in impredicative (higher-order) logics. We illustrate that adding simple axioms such as Leibniz equations to a calculus for an impredicative logic -- in our case a sequent calculus for…
We study the computational content of the Brouwer Fixed Point Theorem in the Weihrauch lattice. Connected choice is the operation that finds a point in a non-empty connected closed set given by negative information. One of our main results…
The TMD soft function can be obtained by formulating the Wilson line in terms of auxiliary 1-dimensional fermion fields on the lattice. In this formulation, the directional vector of the auxiliary field in Euclidean space has the form…
Starting from a simple discrete model which exhibits a supersymmetric invariance we construct a local, interacting, two-dimensional Euclidean lattice theory which also admits an exact supersymmetry. This model is shown to correspond to the…
A Lagrange Theorem in dimension 2 is proved, for a particular two-dimensional algorithm, with a very natural geometrical definition. Dirichlet-type properties for the convergence of the algorithm are also proved. These properties procced…
A non-perturbative algebraic theory of lattice Boltzmann method is developed based on a symmetry of a product. It involves three steps: (i) Derivation of admissible lattices in one spatial dimension through a matching condition which…
It was recently suggested -- based on general self-consistency arguments as well as results from the bootstrap (arXiv:2005.07708, arXiv:2007.11539, arXiv:2007.04190) -- that the CFT describing the $Q$-state Potts model is logarithmic for…
We present algorithms for classification of linear codes over finite fields, based on canonical augmentation and on lattice point enumeration. We apply these algorithms to obtain classification results over fields with 2, 3 and 4 elements.…
The goal of this paper is to present an algebraic approach to the basic results of the theory of linear recurrence relations. This approach is based on the ideas from the theory of representations of one endomorphisms (a special case of…