Related papers: On forbidden poset problems in the linear lattice

A subset $A$ of a given finite abelian group $G$ is called $(k,l)$-sum-free if the sum of $k$ (not necessarily distinct) elements of $A$ does not equal the sum of $l$ (not necessarily distinct) elements of $A$. We are interested in finding…

A vector space S of linear operators between finite-dimensional vector spaces U and V is called locally linearly dependent (in abbreviate form: LLD) when every vector x in U is annihilated by a non-zero operator in S. By a duality argument,…

We introduce a method for proving lower bounds on the efficacy of semidefinite programming (SDP) relaxations for combinatorial problems. In particular, we show that the cut, TSP, and stable set polytopes on $n$-vertex graphs are not the…

We consider 'supersaturation' problems in partially ordered sets (posets) of the following form. Given a finite poset $P$ and an integer $m$ greater than the cardinality of the largest antichain in $P$, what is the minimum number of…

We simulate lattice QCD at non--zero baryon density and zero temperature in the quenched approximation, both in the scaling region and in the infinite coupling limit. We investigate the nature of the forbidden region -- the range of…

Given a finite poset $\mathcal{P}$, a family $\mathcal{F}$ of elements in the Boolean lattice is induced-$\mathcal{P}$-saturated if $\mathcal{F}$ contains no copy of $\mathcal{P}$ as an induced subposet but every proper superset of…

Let $V$ denote an $r$-dimensional $\mathbb{F}_{q^n}$-vector space. Let $U$ and $W$ be $\mathbb{F}_q$-subspaces of $V$, $L_U$ and $L_W$ the projective points of $\mathrm{PG}\,(V,q^n)$ defined by $U$ and $W$ respectively. We address the…

In this paper we consider the classical problem of computing linear extensions of a given poset which is well known to be a difficult problem. However, in our setting the elements of the poset are multivariate polynomials, and only a small…

The Shortest Lattice Vector (SLV) problem is in general hard to solve, except for special cases (such as root lattices and lattices for which an obtuse superbase is known). In this paper, we present a new class of SLV problems that can be…

Let $\mathscr{F}$ and $\mathscr{G}$ be families of $k$- and $\ell$-dimensional subspaces, respectively, of a given $n$-dimensional vector space over a finite field $\mathbb{F}_q$. Suppose that $x \cap y \ne 0$ for all $x \in \mathscr{F}$…

We implement a proposal made in [arXiv:1107.4388] to determine the lattice spacing by matching the lattice vector correlator at a reference distance scale with the same correlator obtained by a dispersion relation based on the $R$-ratio…

We describe a proposal for constructing a lattice theory that we argue may be capable of yielding free Weyl fermions in the continuum limit. The model employs reduced staggered fermions and uses site parity dependent Yukawa interactions of…

We study the problem of determining the size of the largest intersecting $P$-free family for a given partially ordered set (poset) $P$. In particular, we find the exact size of the largest intersecting $B$-free family where $B$ is the…

Combining a modular approach to the $abc$ conjecture developed by the second author with the classical method of linear forms in logarithms, we obtain improved unconditional bounds for two classical problems. First, for Szpiro's conjecture…

Given an arbitrary (commutative) field K, let V be a linear subspace of M_n(K) consisting of matrices of rank lesser than or equal to some r<n. A theorem of Atkinson and Lloyd states that, if dim V>nr-r+1 and #K>r, then either all the…

We determine the asymptotic behavior of the entropy of full coverings of a $L \times M$ square lattice by rods of size $k\times 1$ and $1\times k$, in the limit of large $k$. We show that full coverage is possible only if at least one of…

We determine explicitly the maximal dominant weights for the integrable highest weight $\hat{sl}(n)$-modules $V((k-1)\Lambda_0 + \Lambda_s)$, $0 \leq s \leq n-1$, $ k \geq 2$. We give a conjecture for the number of maximal dominant weights…

A lattice L is spatial if every element of L is a join of completely join-irreducible elements of L (points), and strongly spatial if it is spatial and the minimal coverings of completely join-irreducible elements are well-behaved.…

We prove a general categorical theorem that enables us to state that under certain conditions, the range of a functor is large. As an application, we prove various results of which the following is a prototype: If every diagram, indexed by…

In this paper, we give a lower bound for the maximum size of a $k$-colored sum-free set in $\mathbb{Z}_m^n$, where $k\geq 3$ and $m\geq 2$ are fixed and $n$ tends to infinity. If $m$ is a prime power, this lower bound matches (up to lower…