Related papers: A note on stochastic dominance and compactness

We present a new proof of the following theorem of Benoist-Quint: Let $G:=SO^\circ(d,1)$, $d\ge 2$ and $\Delta<G$ a cocompact lattice. Any orbit of a Zariski dense subgroup $\Gamma$ of $G$ is either finite or dense in $\Delta\backslash G$.…

In this paper we prove that for a fixed neat principal congruence subgroup of a Bianchi group the order of the torsion part of its second cohomology group with coefficients in an integral lattice associated to the m-th symmetric power of…

This paper initiates a systematic development of a theory of non-commutative optimization. It aims to unify and generalize a growing body of work from the past few years which developed and analyzed algorithms for natural geodesically…

In this article we introduce and study uniform and non-uniform approximate lattices in locally compact second countable (lcsc) groups. These are approximate subgroups (in the sense of Tao) which simultaneously generalize lattices in lcsc…

The classic combinatorial construct of {\em maximum matchings} probes the random geometry of regions with local sublattice imbalance in a site-diluted bipartite lattice. We demonstrate that these regions, which host the monomers of any…

We study topological aspects of a compact lattice superconductor, and show that the characteristic energy splitting, $\Delta$, between almost degenerate ground states, is simply related to a novel order parameter $\tilde W$, which is…

In the study of Euclidean lattices, the product of the successive minima is bounded from above and below by explicit quantities. This result is known as Minkowski's second theorem, and can be refined to include Hermite's constant in the…

This paper deals with the problem of robust matrix completion -- retrieving a low-rank matrix and a sparse matrix from the compressed counterpart of their superposition. Though seemingly not an unresolved issue, we point out that the…

This paper introduces statistical order convergence and its pointwise variant for sequences of order bounded operators between Riesz spaces. We establish fundamental properties: uniqueness of the limit, stability under lattice operations,…

We consider the problem of constructing dense lattices of R^n with a given automorphism group. We exhibit a family of such lattices of density at least cn/2^n, which matches, up to a multiplicative constant, the best known density of a…

Suppose that $S_1$ and $S_2$ are nonempty subsets of a complete metric space $(\mathcal{M},d)$ and $\phi,\psi:S_1\to S_2$ are mappings. The aim of this work is to investigate some conditions on $\phi$ and $\psi$ such that the two functions,…

Hadar and Russell (1974) and Levy and Paroush (1974) presented sufficient conditions for multivariate stochastic dominance when the distributions involved are continuous with compact support. Further generalizations involved either…

It is, by now, classical that lattices in higher rank semisimple groups have various rigidity properties. In this work, we add another such rigidity property to the list: uniform stability with respect to the family of unitary operators on…

Kwapien and Woyczynski asked in their monograph (1992) whether their notion of superstrong domination is inherited when taking sums of independent symmetric random vectors (one vector dominates another if, essentially, tail probabilities of…

The Boolean lattice $2^{[n]}$ is the power set of $[n]$ ordered by inclusion. A chain $c_{0}\subset...\subset c_{k}$ in $2^{[n]}$ is rank-symmetric, if $|c_{i}|+|c_{k-i}|=n$ for $i=0,...,k$; and it is symmetric, if $|c_{i}|=(n-k)/2+i$. We…

In various articles, it is said that the class of all soft topologies on a common universe forms a complete lattice, but in this paper, we prove that it is a complete lattice. Some soft topologies are maximal and some are minimal with…

In this paper, we use a simple discrete dynamical model to study integer partitions and their lattice. The set of reachable configurations of the model, with the order induced by the transition rule defined on it, is the lattice of all…

We count primitive lattices of rank $d$ inside $\mathbb{Z}^{n}$ as their covolume tends to infinity, with respect to certain parameters of such lattices. These parameters include, for example, the subsapce that a lattice spans, namely its…

We propose a minimal lattice model for two-dimensional class DIII superconductors with $C_2$-protected higher-order topology. While this class of superconductors cannot be topologically characterized by symmetry eigenvalues at high symmetry…

Low-rank matrix completion (LRMC) problems arise in a wide variety of applications. Previous theory mainly provides conditions for completion under missing-at-random samplings. This paper studies deterministic conditions for completion. An…