Related papers: Covering Distributive Lattices by Intervals

A marked lattice is a $d$-dimensional Euclidean lattice, where each lattice point is assigned a mark via a given random field on ${\mathbb Z}^d$. We prove that, if the field is strongly mixing with a faster-than-logarithmic rate, then for…

Let $P$ be a partially ordered set. If the Boolean lattice $(2^{[n]},\subset)$ can be partitioned into copies of $P$ for some positive integer $n$, then $P$ must satisfy the following two trivial conditions: (1) the size of $P$ is a power…

A set $D \subseteq V$ for the graph $G=(V, E)$ is called a dominating set if any vertex $v\in V\setminus D$ has at least one neighbor in $D$. Fomin et al.[9] gave an algorithm for enumerating all minimal dominating sets with $n$ vertices in…

Suppose L and M are full-rank lattices in Euclidean space, such that vol(L) < vol(M). Answering a question of Han and Wang from 2001, we show how to construct a bounded measurable set F (we can even take F to be a finite union of polytopes)…

This paper deals with join-semilattices whose sections, i.e. principal filters, are pseudocomplemented lattices. The pseudocomplement of a\vee b in the section [b,1] is denoted by a\rightarrow b and can be considered as the connective…

We introduce a model for diffusion of two classes of particles ($A$ and $B$) with priority: where both species are present in the same site the motion of $A$'s takes precedence over that of $B$'s. This describes realistic situations in…

This article describes a practical approach for determining the lattice of subgroups U < V < G between given subgroups U and G, provided the total number of such subgroups is not too large. It builds on existing functionality for element…

Let $K$ be a convex body in $\mathbb{R}^n$, let $L$ be a lattice with covolume one, and let $\eta>0$. We say that $K$ and $L$ form an $\eta$-smooth cover if each point $x \in \mathbb{R}^n$ is covered by $(1 \pm \eta) vol(K)$ translates of…

Suppose that each proper subset of a set $S$ of points in a vector space is contained in the union of planes of specified dimensions, but $S$ itself is not contained in any such union. How large can $|S|$ be? We prove a general upper bound…

We address the question of existence of sections of fibrations in two settings. First, we show that a bundle with base a finite 2-complex admits a section if and only if the inclusion of the fiber is $\pi_1$-injective and the associated…

We give a precise estimate for the number of lattice points in certain bounded subsets of $\mathbb{R}^{n}$ that involve `hyperbolic spikes' and occur naturally in multiplicative Diophantine approximation. We use Wilkie's o-minimal structure…

We demonstrate the existence of quantum droplets in two-component one-dimensional Bose-Hubbard chains. The droplets exist for any strength of repulsive intra-species interactions provided they are balanced by comparable attractive…

Limits of densities belonging to an exponential family appear in many applications, {e.g.} Gibbs models in Statistical Physics, relaxed combinatorial optimization, coding theory, critical likelihood computations, Bayes priors with singular…

In this note, we give a new proof of a result of Matthew Dyer stating that in an arbitrary Coxeter group $W$, every pair $t,t'$ of distinct reflections lie in a unique maximal dihedral reflection subgroup of $W$. Our proof only relies on…

Let $G$ be a finite, non-trivial abelian group of exponent $m$, and suppose that $B_1, ..., B_k$ are generating subsets of $G$. We prove that if $k>2m \ln \log_2 |G|$, then the multiset union $B_1\cup...\cup B_k$ forms an additive basis of…

We study separation of a closed box from a max-min convex set by max-min semispace. This can be regarded as an interval extension of known separation results. We give a constructive proof of the separation in the case when the box and the…

The purpose of this article is to describe and characterize the limit distributions of translates of a bounded open "piece of orbit" of a reductive subgroup on a space of S-arithmetic lattices. This is accomplished under a mild assumption…

A tantalizing open problem, posed independently by Stiebitz in 1995 and by Alon in 2006, asks whether for every pair of integers $s,t \ge 1$ there exists a finite number $F(s,t)$ such that the vertex set of every digraph of minimum…

Given a set $X$, a collection $\mathcal{F} \subset \mathcal{P}(X)$ is said to be $k$-Sperner if it does not contain a chain of length $k+1$ under set inclusion and it is saturated if it is maximal with respect to this probability. Gerbner…

We study Brill-Noether existence on a finite graph using methods from polyhedral geometry and lattices. We start by formulating analogues of the Brill-Noether conjectures (both the existence and non-existence parts) for…