Related papers: Some results on random unimodular lattices
A central question in random matrix theory is universality. When an emergent phenomena is observed from a large collection of chosen random variables it is natural to ask if this behavior is specific to the chosen random variable or if the…
We prove an asymptotic crystallization result in two dimensions for a class of nonlocal particle systems. To be precise, we consider the best approximation with respect to the 2-Wasserstein metric of a given absolutely continuous…
For each $n, d \in \mathbb{N}$ and $0 < \alpha < 1$, we define a random subset of $\mathcal{A}^{\{1, 2, \dots, n\}^d}$ by independently including each element with probability $\alpha$ and excluding it with probability $1-\alpha$, and…
The number of lattice points $\left| tP \cap \mathbb{Z}^d \right|$, as a function of the real variable $t>1$ is studied, where $P \subset \mathbb{R}^d$ belongs to a special class of algebraic cross-polytopes and simplices. It is shown that…
We prove Bernstein-type matrix concentration inequalities for linear combinations with matrix coefficients of binary random variables satisfying certain $\ell_\infty$-independence assumptions, complementing recent results by Kaufman, Kyng…
We present a rough estimation -- up to four significant digits, based on the scaling hypothesis and the probability of belonging to the largest cluster vs. the occupation probability -- of the critical occupation probabilities for the…
For a rank two root system and a pair of nonnegative integers, using only elementary combinatorics we construct two posets. The constructions are uniform across the root systems A1+A1, A2, C2, and G2. Examples appear in Figures 3.2 and 3.3.…
The concept of a $\lambda$-lattice was introduced by V. Sn\'a\v sel in order to generalize some lattice concepts for directed posets whose elements need not have suprema or infima. We extend the concept of semimodularity from lattices to…
Mittag-Leffler modules occur naturally in algebra, algebraic geometry, and model theory, [18], [12], [17]. If $R$ is a non-right perfect ring, then it is known that in contrast with the classes of all projective and flat modules, the class…
Every homomorphism from finite index subgroups of a universal lattices to mapping class groups of orientable surfaces (possibly with punctures), or to outer automorphism groups of finitely generated nonabelian free groups must have finite…
We study the distribution of lattice points with prime coordinates lying in the dilate of a convex planar domain having smooth boundary, with nowhere vanishing curvature. Counting lattice points weighted by a von Mangoldt function gives an…
We prove that if $\phi: {\Bbb R}^d \times {\Bbb R}^d \to {\Bbb R}$, $d \ge 2$, is a homogeneous function, smooth away from the origin and having non-zero Monge-Ampere determinant away from the origin, then $$ R^{-d} # \{(n,m) \in {\Bbb Z}^d…
Based on the recently developed theory of random sequential compactness, we prove the random Kakutani fixed point theorem in random normed modules: if G is a random sequentially compact L0-convex subset of a random normed module, then every…
Associated to a symmetrisable Cartan matrix $C$, Geiss-Lerclerc-Schr\"{o}er constructed and studied a class of Iwanaga-Gorenstein algebras $H$. They proved a generalised version of Gabriel's Theorem, that is, the rank vectors of…
It is conjectured that for fixed $A$, $r \ge 1$, and $d \ge 1$, there is a uniform bound on the size of the torsion submodule of a Drinfeld $A$-module of rank $r$ over a degree $d$ extension $L$ of the fraction field $K$ of $A$. We verify…
In an earlier paper, we discussed the probability that the determinant of a matrix undergoes the least change upon perturbation of one of its elements, provided that most or all of the elements of the matrix are chosen at random and that…
Structures involving a lattice and join-endomorphisms on it are ubiquitous in computer science. We study the cardinality of the set $\mathcal{E}(L)$ of all join-endomorphisms of a given finite lattice $L$. In particular, we show for…
Given any polytope $P$ and any generic linear functional ${\bf c} $, one obtains a directed graph $G(P,{\bf c})$ from the 1-skeleton of $P$ by orienting each edge $e(u,v)$ from $u$ to $v$ for ${\bf c} (u) < {\bf c} ( v)$. For $P$ a simple…
We examine how the measure and the number of vertices of the convex hull of a random sample of $n$ points from an arbitrary probability measure in $\mathbf{R}^d$ relates to the wet part of that measure. This extends classical results for…
Let $\mathbf{A}$ be an $n\times n$-matrix over $\mathbb{F}_2$ whose every entry equals $1$ with probability $d/n$ independently for a fixed $d>0$. Draw a vector $\mathbf{y}$ randomly from the column space of $\mathbf{A}$. It is a simple…