Related papers: Computing Kazhdan constants by semidefinite progra…

Let G:=SO(n,1)^\circ and \Gamma be a geometrically finite Zariski dense subgroup with critical exponent delta bigger than (n-1)/2. Under a spectral gap hypothesis on L^2(\Gamma \ G), which is always satisfied for delta>(n-1)/2 for n=2,3 and…

Upper and lower bounds are given for the maximum Euclidean curvature among faces in Bianchi's fundamental polyhedron for $PSL_2(O)$ in the upper-half space model of hyperbolic space, where $O$ is an imaginary quadratic ring of integers with…

For a finite abelian group $G,$ the Davenport Constant, denoted by $D(G)$, is defined to be the least positive integer $k$ such that every sequence of length at least $k$ has a non-trivial zero-sum subsequence. A long-standing conjecture is…

It was shown in [A. Azimifard, E. Samei, N. Spronk, JFA 2009; arxiv 0805.3685] that the ZL-amenability constant of a finite group is always at least 1, with equality if and only if the group is abelian. It was also shown in the same paper…

A group G is called bounded if every conjugation-invariant norm on G has finite diameter. We introduce various strengthenings of this property and investigate them in several classes of groups including semisimple Lie groups, arithmetic…

For smooth bounded domains in $\mathbb{R}$, we prove upper and lower $L^2$ bounds on the boundary data of Neumann eigenfunctions, and prove quasi-orthogonality of this boundary data in a spectral window. The bounds are tight in the sense…

We study binary classification algorithms for which the prediction on any point is not too sensitive to individual examples in the dataset. Specifically, we consider the notions of uniform stability (Bousquet and Elisseeff, 2001) and…

We investigate the properties of Lindblad equations on $d$-dimensional lattices supporting a unique steady-state configuration. We consider the case of a time evolution weakly symmetric under the action of a finite group $G$, which is also…

We introduce a general framework to design and analyze algorithms for the problem of testing homomorphisms between finite groups in the low-soundness regime. In this regime, we give the first constant-query tests for various families of…

This paper is a new contribution to the study of regular subgroups of the affine group $AGL_n(F)$, for any field $F$. In particular we associate to any partition $\lambda\neq (1^{n+1})$ of $n+1$ abelian regular subgroups in such a way that…

A discrete group which admits a faithful, finite dimensional, linear representation over a field $\mathbb F$ of characteristic zero is called linear. This note combines the natural structure of semi-direct products with work of A. Lubotzky…

The canonical dimension is an invariant attached to admissible representations of p-adic reductive groups, which has only received significant attention in the case of mod-p representations. In the case of complex representations, the…

The stable torsion length in a group is the stable word length with respect to the set of all torsion elements. We show that the stable torsion length vanishes in crystallographic groups. We then give a linear programming algorithm to…

This paper presents the Lagrangian duality theory for mixed-integer semidefinite programming (MISDP). We derive the Lagrangian dual problem and prove that the resulting Lagrangian dual bound dominates the bound obtained from the continuous…

We consider the Membership and the Half-Space Reachability problems for matrices in dimensions two and three. Our first main result is that the Membership Problem is decidable for finitely generated sub-semigroups of the Heisenberg group…

For any two partitions $\lambda$ and $\mu$ of a positive integer $N$, let $\chi_{\lambda}(\mu)$ be the value of the irreducible character of the symmetric group $S_{N}$ associated with $\lambda$, evaluated at the conjugacy class of elements…

It has recently been shown that quantum computers can efficiently solve the Heisenberg hidden subgroup problem, a problem whose classical query complexity is exponential. This quantum algorithm was discovered within the framework of using…

In this paper we describe an algorithm for the computation of canonical forms of finite subsets of $\mathbb{Z}^d$, up to affinities over $\mathbb{Z}$. For fixed dimension $d$, this algorithm has worst-case asymptotic complexity $O(n \log^2…

Starting from the classical results of Shubnikov and Zamorzayev, computer models of shapes are implemented, which allow to visualize the action of discrete subgroups of continuous topological groups. The action is visualize by performing…

This paper is a report on a computer check of some positivity properties of the Hecke algebra in type H4, including the non-negativity of the coefficients of the structure constants in the Kazhdan-Lusztig basis. This answers a long-standing…