Related papers: When lattice cubes meet affine subspaces: a short …
We show that affine coordinate subspaces of dimension at least two in Euclidean space are of Khintchine type for divergence. For affine coordinate subspaces of dimension one, we prove a result which depends on the dual Diophantine type of…
The interrelations between various classes of convergence spaces defined by countability conditions are studied. Remarkably, they all find characterizations in the usual space of ultrafilters in terms of classical topological properties.…
By a 1997 result of R. Freese, an $n$-element lattice has at most $2^{n-1}$ congruences. This motivates us to define the congruence density cd$(L)$ of a finite $n$-element lattice as $|$Con$(L)|/2^{n-1}$, where $|$Con$(L)|$ is the number of…
We get sharp degree bound for generic smoothness and connectedness of the space of conics in low degree complete intersections which generalizes the old work about Fano scheme of lines on Hypersurfaces.
We prove that on a closed, orientable surface of genus $g$, a set of simple loops with the property that no two are homotopic or intersect in more than $k$ points has cardinality $\lesssim_k g^{k+1} \log g$. The bound matches the size of…
In this note, we discuss Hassett maximal cubic fourfolds and construct an explicit irreducible component of maximal dimension sixteen of the locus $\mathcal{Z}$ of Hassett maximal cubic fourfolds. We utilize algebraic and arithmetic methods…
A graph is called matching covered if for its every edge there is a maximum matching containing it. It is shown that minimal matching covered graphs contain a perfect matching.
An axis-parallel b-dimensional box is a Cartesian product $R_1 \times R_2 \times ... \times R_b$ where each $R_i$ (for $1 \leq i \leq b$) is a closed interval of the form $[a_i,b_i]$ on the real line. The boxicity of any graph $G$, box(G)…
We prove that a tolerance relation of a lattice is a homomorphic image of a congruence relation.
We study one particle subspaces for two particles of different masses with ultra local interaction on a lattice of arbitrary dimension.
Ordinary Coincidence Site Lattices (CSLs) are defined as the intersection of a lattice $\Gamma$ with a rotated copy $R\Gamma$ of itself. They are useful for classifying grain boundaries and have been studied extensively since the mid…
Algebraic surfaces in the complex projective space with a high number of A-type singularities have been presented in a recent paper. We extend the construction in order to obtain lower bounds for the maximal number of A singularities for…
We consider the coincidence problem for the square lattice that is translated by an arbitrary vector. General results are obtained about the set of coincidence isometries and the coincidence site lattices of a shifted square lattice by…
Using combinatorial methods, we derive several formulas for the volume of convex bodies obtained by intersecting a unit hypercube with a halfspace, or with a hyperplane of codimension 1, or with a flat defined by two parallel hyperplanes.…
We consider the maximum chromatic number of hypergraphs consisting of cliques that have pairwise small intersections. Designs of the appropriate parameters produce optimal constructions, but these are known to exist only when the number of…
In this note, we find a sharp bound for the minimal number (or in general, indexing set) of subspaces of a fixed (finite) codimension needed to cover any vector space V over any field. If V is a finite set, this is related to the problem of…
For the family of graded lattice ideals of dimension 1, we establish a complete intersection criterion in algebraic and geometric terms. In positive characteristic, it is shown that all ideals of this family are binomial set theoretic…
Recently, K.-Y. Wu introduced affine subspace concentration conditions for the cone volumes of polytopes and proved that the cone volumes of centered, reflexive, smooth lattice polytopes satisfy these conditions. We extend the result to…
A linear arrangement is a labeling or a numbering or a linear ordering of the vertices of a graph. In this paper we solve the minimum linear arrangement problem for bijective connection graphs (for short BC graphs) which include hypercubes,…
The purpose of this note is to study configurations of lines in projective planes over arbitrary fields having the maximal number of intersection points where three lines meet. We give precise conditions on ground fields F over which such…