Related papers: The second minimum of Barnes-Wall lattices
Consider a real-valued branching random walk in the boundary case. Using the techniques developed by A\"id\'ekon and Shi [5], we give two integral tests which describe respectively the lower limits for the minimal position and the upper…
Some monotone increasing sequences of the lower bounds for the minimum eigenvalue of $M$-matrices are given. It is proved that these sequences are convergent and improve some existing results. Numerical examples show that these sequences…
Our main result is a sharp bound for the number of vertices in a minimal forbidden subgraph for the graphs having minimum rank at most 3 over the finite field of order 2. We also list all 62 such minimal forbidden subgraphs. We conclude by…
Given a $\{ 0, 1, \ast \}$-matrix $M$, a minimal $M$-obstruction is a digraph $D$ such that $D$ is not $M$-partitionable, but every proper induced subdigraph of $D$ is. In this note we present a list of all the $M$-obstructions for every $2…
Confirming a conjecture of Pa{\l}asi\'nski and Wro\'nski, we show that the bottom of the lattice of subvarieties of BCK is Y-shaped.
Let $C(G)$ be the poset of cyclic subgroups of a finite group $G$ and let $\mathcal{P}$ be the class of $p$-groups of order $p^n$ ($n\geq 3$). Consider the function $\alpha:\mathcal{P}\longrightarrow (0, 1]$ given by…
Function field lattices are an interesting example of algebraically constructed lattices. Their minimum distance is bounded below by a function of the gonality of the underlying function field. Known explicit examples--coming mostly from…
We study the essential minimum of the (stable) Faltings height on the moduli space of elliptic curves. We prove that, in contrast to the Weil height on a projective space and the N{\'e}ron-Tate height of an abelian variety, Faltings' height…
We give a new proof of the Minkowski-Hlawka bound on the existence of dense lattices. The proof is based on an elementary method for constructing dense lattices which is almost effective.
The famous Barnes-Wall lattices can be obtained by applying Construction D to a chain of Reed-Muller codes. By applying Construction ${{D}}^{{(cyc)}}$ to a chain of extended cyclic codes sandwiched between Reed-Muller codes, Hu and Nebe (J.…
The new property of minimal surfaces is obtained in this article.
We show that computing the minimum rank of a sign pattern matrix is NP hard. Our proof is based on a simple but useful connection between minimum ranks of sign pattern matrices and the stretchability problem for pseudolines arrangements. In…
We introduce an alternative stratification of knots: by the size of lattice on which a knot can be first met. Using this classification, we find ratio of unknots and knots with more than 10 minimal crossings inside different lattices and…
A two species interacting system motivated by the density functional theory for triblock copolymers contains long range interaction that affects the two species differently. In a two species periodic assembly of discs, the two species…
We disprove a conjecture by Ye and Lim, by showing that there are $3 \times 3$ complex matrices which can't be expressed as the product of two Toeplitz matrices of the same size. We also improve previous estimates by Ye and Lim on the…
It is shown that extremal $2$-modular lattices of ranks $32$ and $48$ are generated by their vectors of minimal norm. In the proof, we use certain properties of the difference of normalized Hecke eigenforms. We refer to them as the…
This is a continuation of the article with the same title. In this paper, the family H is the same as in the previous paper "On Graphs with the Smallest Eigenvalue at Least $-1-\sqrt{2}$, part I". The main result is that a minimal graph…
In this paper we present a surprisingly short proof of Minkowski's second theorem. The author hopes there is no mistake in it, though the argument seems to be too plain to contain one. Also, we apply the main construction of the proof to…
We find the smallest possible covolume for lattices in PGL3(Q2), show that there are exactly two lattices with this covolume, and describe them explicitly. They are commensurable, and one of them appeared in Mumford's construction of his…
We present an algorithm for generating approximations for the logarithm of Barnes $G$-function in the half-plane $Re(z)\ge 3/2$. These approximations involve only elementary functions and are easy to implement. The algorithm is based on a…