Related papers: The second minimum of Barnes-Wall lattices
We prove an existence theorem for good moduli spaces, and use it to construct the second flip in the log minimal model program for the moduli space of stable curves. In fact, our methods give a uniform, self-contained construction of the…
We construct a sequence of smooth minimizing surfaces in a sequence of metrics converging to the standard Euclidean metric, so that they have diverging $L^2$ norm of second fundamental form.
Our main result is designing an algorithm that returns a vertex cover of $\mathcal{G}^\star$ with size at most $(3/2+\epsilon)$ times the expected size of the minimum vertex cover, using only $O(n/\epsilon p)$ non-adaptive queries. This…
We show that every minimum area isosceles triangle containing a given triangle $T$ shares a side and an angle with $T$. This proves a conjecture of Nandakumar motivated by a computational problem. We use our result to deduce that for every…
A brick is a 3-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. A brick is minimal if for every edge e the deletion of e results in a graph that is not a brick. We prove a…
We introduce a new type of lattice path, called brick-wall lattice path, and we derive a formula which counts the number of paths on these lattices imposing certain restrictions on the Cartesian plane. Connections to the Fibonacci sequence,…
We show the rank (i.e. minimal size of a generating set) of lattices cannot grow faster than the volume.
For a many-to-many matching market, we study the lattice structure of the set of random stable matchings. We define a partial order on the random stable set and present two intuitive binary operations to compute the least upper bound and…
We confirm Martin's conjecture for a broad subclass of weakly quasi-o-minimal theories.
We prove that the number s(n) of disjoint minimal graphs supported on domains in R^n is bounded by e(n+1)^2. In the two-dimensional case we show that s(2) is at most three (the conjectured number is two).
By a twenty year old result of Ralph Freese, an $n$-element lattice $L$ has at most $2^{n-1}$ congruences. We prove that if $L$ has less than $2^{n-1}$ congruences, then it has at most $2^{n-2}$ congruences. Also, we describe the…
We show existence of minimizers for the Hardy-Sobolev-Maz'ya inequality in $R^{m+n}\setminus\R^n$ for $m=1$ and $n>2$ or for $m>2$ and $n>0$.
We give lower bounds on the case of worst inhomogeneous approximation.
In this work we present new wall-laws boundary conditions including microscopic oscillations. We consider a newtonian flow in domains with periodic rough boundaries that we simplify considering a Laplace operator with periodic inflow and…
A partial formula is provided to calculate the smallest number of vertices possible in a quadrangulation on the closed orientable 2-manifold of given genus. This extends the previously known partial formula due to N. Hartsfield and G.…
We give a new combinatorial proof for the number of convex polyominoes whose minimum enclosing rectangle has given dimensions. We also count the subclass of these polyominoes that contain the lower left corner of the enclosing rectangle…
We study the shortest vector lengths in module lattices over arbitrary number fields, with an emphasis on cyclotomic fields. In particular, we sharpen the techniques of arXiv:2308.15275v2 to establish improved results for the variance of…
Sinkhorn's alternative minimization algorithm applied to a positive $n\times n$ matrix converges to a doubly stochastic matrix. If the algorithm, applied to a $2\times 2$ matrix, converges in a finite number of iterations, then it converges…
In the present paper, we give Assmus--Mattson type theorems for codes and lattices. We show that a binary doubly even self-dual code of length 24m with minimum weight 4m provides a combinatorial 1-design and an even unimodular lattice of…
In the present paper we bring together minimality conditions proposed in previous two papers and present some new minimality conditions for classical and virtual knots and links.