English
Related papers

Related papers: Rigidity sequences, Kazhdan sets and group topolog…

200 papers

Recurrence properties of systems and associated sets of integers that suffice for recurrence are classical objects in topological dynamics. We describe relations between recurrence in different sorts of systems, study ways to formulate…

Dynamical Systems · Mathematics 2014-08-13 Bernard Host , Bryna Kra , Alejandro Maass

The results of Bergelson-Host-Kra and Leibman say that a multiple polynomial correlation sequence can be decomposed into a sum of a nilsequence (a sequence defined by evaluating a continuous function along an orbit in a nilsystem) and a…

Dynamical Systems · Mathematics 2020-04-29 Anh Ngoc Le

Many deep, mysterious connections have been observed between collections of mutually unbiased bases (MUBs) and combinatorial designs called $k$-nets (and in particular, between complete collections of MUBs and finite affine - or…

Mathematical Physics · Physics 2019-07-05 Sloan Nietert , Zsombor Szilágyi , Mihály Weiner

We present a novel construction of linear deformations for Lie algebras and use it to prove the non-rigidity of several classes of Lie algebras in different varieties. We consider the family of Lie algebras with an abelian factor showing…

Rings and Algebras · Mathematics 2022-07-19 Josefina Barrionuevo , Paulo Tirao

If $G$ is an abelian group, we say $S\subset G$ is a set of recurrence if for every probability measure preserving $G$-system $(X,\mu,T)$ and every $D\subset X$ having $\mu(D)>0$, there is a $g\in S$ such that $\mu(D\cap T^{g}D)>0$. We say…

Dynamical Systems · Mathematics 2024-12-30 John T. Griesmer

We adapt the construction of subsets of {1, 2, ..., N} that contain no k-term arithmetic progressions to give a relatively thick subset of an arbitrary set of N integers. Particular examples include a thick subset of {1, 4, 9, ..., N^2}…

Number Theory · Mathematics 2010-06-25 Kevin O'Bryant

A sequence of non-negative integers is exactly realizable as the fixed point counts sequence of a dynamical system if and only if it gives rise to a sequence of non-negative orbit counts. This provides a simple realizability criterion based…

Dynamical Systems · Mathematics 2009-05-11 Natascha Neumaerker

We give a number of results about families of Ulam sets. Generalizing behavior of Ulam sets U(1,n), we prove using an novel model theoretic approach that there is a rigidity phenomenon for Ulam sets U(a,b) as b increases. Based on this, we…

Number Theory · Mathematics 2017-11-02 Joshua Hinman , Borys Kuca , Alexander Schlesinger , Arseniy Sheydvasser

We introduce and study asymptotically rigid mapping class groups of certain infinite graphs. We determine their finiteness properties and show that these depend on the number of ends of the underlying graph. In a special case where the…

Geometric Topology · Mathematics 2025-09-01 Thomas Hill , Sanghoon Kwak , Brian Udall , Jeremy West

Let K be a p-adic field and let F and G be two formal groups over O_K. We prove that if F and G have infinitely many torsion points in common, then F=G. This follows from a rigidity result: any bounded power series that sends infinitely…

Number Theory · Mathematics 2019-01-15 Laurent Berger

We consider numeration systems based on a $d$-tuple $\mathbf{U}=(U_1,\ldots,U_d)$ of sequences of integers and we define $(\mathbf{U},\mathbb{K})$-regular sequences through $\mathbb{K}$-recognizable formal series, where $\mathbb{K}$ is any…

Combinatorics · Mathematics 2021-01-07 Émilie Charlier , Célia Cisternino , Manon Stipulanti

We study properties of a sequence $\Lambda$ obtained by a randomselection of integers $n$, where $n\in\Lambda$ with probability $\varpi_{n}$, independently of the other choices. We distinguish two cases : if…

Classical Analysis and ODEs · Mathematics 2007-05-30 Jean-Pierre Kahane , Yitzhak Katznelson

We consider ordered tuples in finite groups generating nilpotent subgroups. Given an integer $q$ we consider the poset of nilpotent subgroups of class less than $q$ and its corresponding coset poset. These posets give rise to a family of…

Group Theory · Mathematics 2014-02-26 Enrique Torres-Giese

We give bounds on Kazhdan constants of abelian extensions of (finite) groups. As a corollary, we improved known results of Kazhdan constants for some meta-abelian groups and for the relatively free group in the variety of $p$-groups of…

Group Theory · Mathematics 2010-07-27 Uzy Hadad

Given any Coxeter group, we define rigid reflections and rigid roots using non-self-intersecting curves on a Riemann surface with labeled curves. When the Coxeter group arises from an acyclic quiver, they are related to the rigid…

Representation Theory · Mathematics 2018-03-15 Kyu-Hwan Lee , Kyungyong Lee

Using functional and harmonic analysis methods, we study Kazhdan sets in topological groups which do not necessarily have Property (T). We provide a new criterion for a generating subset $Q$ of a group $G$ to be a Kazhdan set; it relies on…

Group Theory · Mathematics 2018-06-05 Catalin Badea , Sophie Grivaux

A theory T is tight if different deductively closed extensions of T (in the same language) cannot be bi-interpretable. Many well-studied foundational theories are tight, including PA [Visser2006], ZF, Z2, and KM [enayat2017]. In this…

Logic · Mathematics 2023-05-16 Alfredo Roque Freire , Kameryn J. Williams

Let $\mathbb{k}$ be a commutative ring with global dimension zero. We show that we can rigidify homotopy coherent comodules in connective modules over the Eilenberg-Mac Lane spectrum of $\mathbb{k}$. That is, the $\infty$-category of…

Algebraic Topology · Mathematics 2024-04-09 Maximilien Péroux

To give positive answer to a question of Frantzikinakis, we study a class of subsets of $\mathbb{N}$, called interpolation sets, on which every bounded sequence can be extended to an almost periodic sequence on $\mathbb{N}$. Strzelecki has…

Dynamical Systems · Mathematics 2019-05-15 Anh N. Le

We use algebraic geometry to study matrix rigidity, and more generally, the complexity of computing a matrix-vector product, continuing a study initiated by Kumar, et. al. We (i) exhibit many non-obvious equations testing for (border)…

Computational Complexity · Computer Science 2015-03-11 Fulvio Gesmundo , Jonathan Hauenstein , Christian Ikenmeyer , JM Landsberg