Related papers: Frames in the odd Leech lattice
A normal odd partition T of the edges of a cubic graph is a partition into trails of odd length (no repeated edge) such that each vertex is the end vertex of exactly one trail of the partition and internal in some trail. For each vertex v,…
We provide a new lower bound on the number of $(\leq k)$-edges of a set of $n$ points in the plane in general position. We show that for $0 \leq k \leq\lfloor\frac{n-2}{2}\rfloor$ the number of $(\leq k)$-edges is at least $$ E_k(S) \geq…
We show the existence of 112 non-singular rational curves on the supersingular K3 surface with Artin invariant 1 in characteristic 3 by several ways. Using these rational curves, we have a $(16)_{10}$-configuration and a $(280_{4},…
We give a bound of $k$ for a very ample lattice polytope to be $k$-normal. Equivalently, we give a new combinatorial bound for the Castelnuovo-Mumford regularity of normal projective toric varieties.
Let $\# K$ be a number of integer lattice points contained in a set $K$. In this paper we prove that for each $d\in {\mathbb N}$ there exists a constant $C(d)$ depending on $d$ only, such that for any origin-symmetric convex body $K \subset…
We study the fundamental algorithmic rigidity problems for generic frameworks periodic with respect to a fixed lattice or a finite-order rotation in the plane. For fixed-lattice frameworks we give an $O(n^2)$ algorithm for deciding generic…
We state the formula for the critical number of vertices of a convex lattice polygon that guarantees that the polygon contains at least one point of a given sublattice and give a partial proof of the formula. We show that the proof can be…
In this paper, we construct odd unimodular lattices in dimensions n=36,37 having minimum norm 3 and 4s=n-16, where s is the minimum norm of the shadow. We also construct odd unimodular lattices in dimensions n=41,43,44 having minimum norm 4…
We prove that for every odd $q\geq 3$, any $q$-query binary, possibly non-linear locally decodable code ($q$-LDC) $E:\{\pm1\}^k \rightarrow \{\pm1\}^n$ must satisfy $k \leq \tilde{O}(n^{1-2/q})$. For even $q$, this bound was established in…
It is shown that if there is an extremal even unimodular lattice in dimension 72, then there is an optimal odd unimodular lattice in that dimension. Hence, the first example of an optimal odd unimodular lattice in dimension 72 is…
A generalization of the four-color theorem, Hadwiger's conjecture is considered as one of the most important and challenging problems in graph theory, and odd Hadwiger's conjecture is a strengthening of Hadwiger's conjecture by way of…
Let K be a an alternating prime knot in the 3-sphere. We investigate the category of flypes between reduced alternating diagrams for K. As a consequence, we show that any odd prime order action on K is isotopic through maps of pairs to a…
A periodic lattice in Euclidean 3-space is the infinite set of all integer linear combinations of basis vectors. Any lattice can be generated by infinitely many different bases. This ambiguity was only partially resolved, but standard…
We extend Hoffman's coclique bound for regular digraphs with the property that its adjacency matrix is normal, and discuss cocliques attaining the inequality. As a consequence, we characterize skew-Bush-type Hadamard matrices in terms of…
We describe a method for computing the anomaly of any finite unitary symmetry group $G$ acting by finite-depth quantum circuits on a two-dimensional lattice system. The anomaly is characterized by an index valued in the cohomology group…
We prove that every internally 4-connected non-planar bipartite graph has an odd K_3,3 subdivision; that is, a subgraph obtained from K_3,3 by replacing its edges by internally disjoint odd paths with the same ends. The proof gives rise to…
We study the set of visible lattice points in multidimensional hypercubes. The problems we investigate mix together geometric, probabilistic and number theoretic tones. For example, we prove that almost all self-visible triangles with…
Some additive reverses of the generalised triangle inequality in normed linear spaces are given. Applications for complex numbers are provided as well.
We construct a K3 surface over an algebraically closed field of characteristic 2 which contains two sets of 21 disjoint smooth rational curves such that each curve from one set intersects exactly 5 curves from the other set. This…
We present a deterministic linear-time algorithm for finding an odd cycle through two specified vertices in an undirected graph. This is shown in a generalized form as follows: Let $\Gamma$ be any group in which every element is of order at…