English
Related papers

Related papers: Nil Bohr-sets and almost automorphy of higher orde…

200 papers

The problem which can be viewed as the higher order version of an old question concerning Bohr sets is investigated: for any $d\in \N$ does the collection of $\{n\in \Z: S\cap (S-n)\cap...\cap (S-dn)\neq \emptyset\}$ with $S$ syndetic…

Dynamical Systems · Mathematics 2011-09-19 Wen Huang , Song Shao , Xiangdong Ye

In this paper, $d$-step almost automorphic systems are studied for $d\in\N$, which are the generalization of the classical almost automorphic ones. For a minimal topological dynamical system $(X,T)$ it is shown that the condition $x\in X$…

Dynamical Systems · Mathematics 2011-11-01 Wen Huang , Song Shao , Xiangdong Ye

We study relations between subsets of integers that are large, where large can be interpreted in terms of size (such as a set of positive upper density or a set with bounded gaps) or in terms of additive structure (such as a Bohr set). Bohr…

Dynamical Systems · Mathematics 2012-09-27 Bernard Host , Bryna Kra

The aim of this note is to provide a conceptually simple demonstration of the fact that repetitive model sets are characterized as the repetitive Meyer sets with an almost automorphic associated dynamical system.

Dynamical Systems · Mathematics 2016-04-06 Jean-baptiste Aujogue

We study a broad class of qudit stabilizer codes, termed $\mathbb{Z}_N$ bivariate-bicycle (BB) codes, arising either as two-dimensional realizations of modulated gauge theories or as $\mathbb{Z}_N$ generalizations of binary BB codes. Our…

Strongly Correlated Electrons · Physics 2026-05-08 Siyu He , Hao Song

We prove three results concerning the existence of Bohr sets in threefold sumsets. More precisely, letting $G$ be a countable discrete abelian group and $\phi_1, \phi_2, \phi_3: G \to G$ be commuting endomorphisms whose images have finite…

Combinatorics · Mathematics 2023-06-08 John T. Griesmer , Anh N. Le , Thái Hoàng Lê

Finite covers are a technique for building new structures from simpler ones. The original motivation to study finite covers is in the Ladder theorem of Zilber which describes how totally categorical structures are built from strictly…

Logic · Mathematics 2007-06-13 Elisabetta Pastori

Nilsystems are a natural generalization of rotations and arise in various contexts, including in the study of multiple ergodic averages in ergodic theory, in the structural analysis of topological dynamical systems, and in asymptotics for…

Dynamical Systems · Mathematics 2012-05-15 Bernard Host , Bryna Kra , Alejandro Maass

Let $G$ be an additive group of order $v$. A $k$-element subset $D$ of $G$ is called a $(v, k, \lambda, t)$-almost difference set if the expressions $gh^{-1}$, for $g$ and $h$ in $D$, represent $t$ of the non-identity elements in $G$…

Combinatorics · Mathematics 2014-09-02 Kathleen Nowak

We focus on the presence of almost automorphy in strongly monotone skew-product semiflows on Banach spaces. Under the $C^1$-smoothness assumption, it is shown that any linearly stable minimal set must be almost automorphic. This extends the…

Dynamical Systems · Mathematics 2022-03-09 Yi Wang , Jinxiang Yao

This paper provides a unifying framework for a range of categorical constructions characterised by universal mapping properties, within the realm of compactifications of discrete structures. Some classic examples fit within this broad…

Rings and Algebras · Mathematics 2015-06-02 B. A. Davey , M. Haviar , H. A. Priestley

We study the topological recurrence phenomenon of actions of locally compact abelian groups on compact metric spaces. In the case of $\mathbb{Z}^d$-actions we develop new techniques to analyze Bohr recurrence sets. These techniques include…

Dynamical Systems · Mathematics 2024-11-28 Sebastián Donoso , Felipe Hernández , Alejandro Maass

This paper is about the maximally monotone and quasidense subsets of the product of a real Banach space and its dual. We discuss six subclasses of the maximal monotone sets that are equivalent to the quasidense ones. We define the Gossez…

Functional Analysis · Mathematics 2025-10-08 Stephen Simons

In this article we introduce a class of discontinuous almost automorphic functions which appears naturally in the study of almost automorphic solutions of differential equations with piecewise constant argument. Their fundamental properties…

Classical Analysis and ODEs · Mathematics 2013-06-06 A. Chavez , S. Castillo , M. Pinto

Let $D$ be a disk in $\mathbb{R}^n$ and $f\in C^{r+2}(D, \mathbb{R}^k)$. We deal with the problem of the algebraic approximation of the set $j^{r}f^{-1}(W)$ consisting of the set of points in the disk $D$ where the $r$-th jet extension of…

Differential Geometry · Mathematics 2020-10-29 Antonio Lerario , Michele Stecconi

Bohr chaoticity is a topological notion of dynamical complexity defined through non-orthogonality to all non-trivial weights. It is strictly stronger than positivity of topological entropy and also has strong consequences for the…

Dynamical Systems · Mathematics 2026-04-08 Xiaobo Hou , Wanshan Lin , Xueting Tian

We study $n$-vertex $d$-dimensional polytopes with at most one nonsimplex facet with, say, $d+s$ vertices, called {\it almost simplicial polytopes}. We provide tight lower and upper bound theorems for these polytopes as functions of $d,n$…

Combinatorics · Mathematics 2018-11-20 Eran Nevo , Guillermo Pineda-Villavicencio , Julien Ugon , David Yost

In this paper, it is shown that for a minimal system $(X,T)$ and $d,k\in \mathbb{N}$, if $(x,x_i)$ is regionally proximal of order $d$ for $1\leq i\leq k$, then $(x,x_1,\ldots,x_k)$ is $(k+1)$-regionally proximal of order $d$. Meanwhile, we…

Dynamical Systems · Mathematics 2021-07-27 Jiahao Qiu

Symmetric Grothendieck polynomials are inhomogeneous versions of Schur polynomials that arise in combinatorial $K$-theory. A polynomial has saturated Newton polytope (SNP) if every lattice point in the polytope is an exponent vector. We…

Combinatorics · Mathematics 2017-10-17 Laura Escobar , Alexander Yong

In the Maximum Independent Set problem we are asked to find a set of pairwise nonadjacent vertices in a given graph with the maximum possible cardinality. In general graphs, this classical problem is known to be NP-hard and hard to…

Data Structures and Algorithms · Computer Science 2023-11-15 Maria Chudnovsky , Marcin Pilipczuk , Michał Pilipczuk , Stéphan Thomassé
‹ Prev 1 2 3 10 Next ›