Related papers: Computing Kazhdan constants by semidefinite progra…

We develop an algorithm that computes strongly continuous semigroups on infinite-dimensional Hilbert spaces with explicit error control. Given a generator $A$, a time $t>0$, an arbitrary initial vector $u_0$ and an error tolerance…

We study irreducible restrictions from modules over symmetric groups to subgroups. We get reduction results which substantially restrict the classes of subgroups and modules for which this is possible. Such results are known when the…

Computations in small Coxeter groups or dihedral groups suggest that the partition into Kazhdan-Lusztig cells with unequal parameters should obey to some semicontinuity phenomenon (as the parameters vary). The aim of this paper is to…

Low-energy effective theories have been used very successfully to study the low-energy limit of QCD, providing us with results for a plethora of phenomena, ranging from bound-state formation to phase transitions in QCD. These theories are…

Motivated by applications in spatial genomics, we revisit group testing (Dorfman~1943) and propose the class of $\lambda$-{\sf ADD}-codes, studying such codes with certain distance $d$ and codelength $n$. When $d$ is constant, we provide…

We apply the local discontinuous Galerkin (LDG for short) method to solve a mixed boundary value problems for the Helmholtz equation in bounded polygonal domain in 2D. Under some assumptions on regularity of the solution of an adjoint…

Let $G$ be a finite abelian group. The Erd{\H{o}}s-Ginzburg-Ziv constant $\mathsf s(G)$ of $G$ is defined as the smallest integer $l\in \mathbb{N}$ such that every sequence $S$ over $G$ of length $|S|\geq l$ has a zero-sum subsequence $T$…

Let $G$ be a finite abelian group. The Erd{\H o}s--Ginzburg--Ziv constant $\mathsf s (G)$ of $G$ is defined as the smallest integer $l \in \mathbb N$ such that every sequence \ $S$ \ over $G$ of length $|S| \ge l$ \ has a zero-sum…

Let $G=\mathrm{SL}(2,\mathbb{Z})\ltimes\mathbb{Z}^2$ and $H=\mathrm{SL}(2,\mathbb{Z})$. We prove that the action $G\curvearrowright\mathbb{R}^2$ is uniformly non-amenable and that the quasi-regular representation of $G$ on $\ell^2(G/H)$ has…

We obtain restrictions on units of even order in the integral group ring $\mathbb{Z}G$ of a finite group $G$ by studying their actions on the reductions modulo $4$ of lattices over the $2$-adic group ring $\mathbb{Z}_2G$. This improves the…

Let $G$ be a finite group. By a sequence over $G$, we mean a finite unordered string of terms from $G$ with repetition allowed, and we say that it is a product-one sequence if its terms can be ordered so that their product is the identity…

In this paper we study the robustness of strong stability of a discrete semigroup on a Hilbert space under bounded finite rank perturbations. As the main result we characterize classes of perturbations preserving the strong stability of the…

The positive semidefinite rank of a convex body $C$ is the size of its smallest positive semidefinite formulation. We show that the positive semidefinite rank of any convex body $C$ is at least $\sqrt{\log d}$ where $d$ is the smallest…

This work presents a hybrid approach to solve the maximum stable set problem, using constraint and semidefinite programming. The approach consists of two steps: subproblem generation and subproblem solution. First we rank the variable…

We exhibit explicit infinite families of finitely presented, Kazhdan, simple groups that are pairwise not measure equivalent. These groups are lattices acting on products of buildings. We obtain the result by studying vanishing and…

The question of computing the group complexity of finite semigroups and automata was first posed in K. Krohn and J. Rhodes, \textit{Complexity of finite semigroups}, Annals of Mathematics (2) \textbf{88} (1968), 128--160, motivated by the…

We give a lower bound for the value at q=1 of a Kazhdan-Lustig polynomial in a Weyl group W in terms of "patterns''. This is expressed by a "pattern map" from W to W' for any parabloic subgroup W'. This notion generalizes the concept of…

Low-degree polynomials have emerged as a powerful paradigm for providing evidence of statistical-computational gaps across a variety of high-dimensional statistical models [Wein25]. For detection problems -- where the goal is to test a…

In this paper, we explore the application of semidefinite programming to the realm of quantum codes, specifically focusing on codeword stabilized (CWS) codes with entanglement assistance. Notably, we utilize the isotropic subgroup of the…

Discrete subgroups of SL(2,R) are well understood, and classified by the geometry of the corresponding hyperbolic surfaces. Discrete subgroups of higher-rank semisimple Lie groups, such as SL(n,R) for n>2, remain more mysterious. While…