English
Related papers

Related papers: Quantitative recurrence properties of expanding ma…

200 papers

We study the sequence entropy of rank one measure-preserving systems along subexponential sequences. We prove that the sequence entropy along a large class of sequences can be infinite using Ornstein's probabilistic constructions. Moreover,…

Dynamical Systems · Mathematics 2026-04-22 Shigenori Takeda

Let $X$ be a real Banach space with a normalized duality mapping uniformly norm-to-weak$^\star$ continuous on bounded sets or a reflexive Banach space which admits a weakly continuous duality mapping $J_{\Phi}$ with gauge $\phi$. Let $f$ be…

Optimization and Control · Mathematics 2007-12-10 Jean-Philippe Chancelier

We consider the set of all 2-step recurrences (difference equations) that are given by linear fractional maps. These give birational maps of the plane. We determine the degree growth of these birational maps. We find the all the maps in…

Dynamical Systems · Mathematics 2007-05-23 Eric Bedford , Kyounghee Kim

Let $a_1 = 1$ and, for $n > 1$, $a_n = a_{n-1} + a_{\left \lfloor \frac{n}{2} \right \rfloor}$. In this paper we will look at congruence properties and the growth rate of this sequence. First we will show that if $x \in \{1, 2, 3, 5, 6, 7…

Number Theory · Mathematics 2024-06-17 Wouter van Doorn

For a linear code $C$ of length $n$ with dimension $k$ and minimum distance $d$, it is desirable that the quantity $kd/n$ is large. Given an arbitrary field $\mathbb{F}$, we introduce a novel, but elementary, construction that produces a…

Information Theory · Computer Science 2021-10-05 Faezeh Alizadeh , S. P. Glasby , Cheryl E. Praeger

For a bilinear map $*:\mathbb R^d\times \mathbb R^d\to \mathbb R^d$ of nonnegative coefficients and a vector $s\in \mathbb R^d$ of positive entries, among an exponentially number of ways combining $n$ instances of $s$ using $n-1$…

Discrete Mathematics · Computer Science 2021-04-22 Vuong Bui

Generic quantum systems --as much as their classical counterparts-- pass arbitrarily close to their initial state after sufficiently long time. Here we provide an essentially exact computation of such recurrence times for generic…

Quantum Physics · Physics 2015-09-29 Lorenzo Campos Venuti

The main result given in Theorem~1.1 is a condition for a map $X$, defined on the complement of a disk $D$ in R^2 with values in R^2, to be extended to a topological embedding of R^2, not necessarily surjective. The map $X$ is supposed to…

Dynamical Systems · Mathematics 2007-05-23 Carlos Gutierrez , Roland Rabanal

We establish a connection between gaps problems in Diophantine approximation and the frequency spectrum of patches in cut and project sets with special windows. Our theorems provide bounds for the number of distinct frequencies of patches…

Dynamical Systems · Mathematics 2016-06-01 Alan Haynes , Henna Koivusalo , Lorenzo Sadun , James Walton

The purpose of this article is to study the eigenvalues $u_1^{\, t}=e^{it\theta_1},\dots,u_N^{\,t}=e^{it\theta_N}$ of $U^t$ where $U$ is a large $N\times N$ random unitary matrix and $t>0$. In particular we are interested in the typical…

Mathematical Physics · Physics 2015-06-17 Olivier Marchal

In this paper we show that the piecewise linear map f(x) = px for x in [0,1/p], and sx-s/p for x in (1/p,1], p > 1, 0 < s < 1 which has an expanding, onto branch and a contracting branch is eventually piecewise expanding and exact.

Dynamical Systems · Mathematics 2011-08-18 Peyman Eslami , Pawel Gora

We consider the distribution of the orbits of the number 1 under the $\beta$-transformations $T_\beta$ as $\beta$ varies. Mainly, the size of the set of $\beta>1$ for which a given point can be well approximated by the orbit of 1 is…

Dynamical Systems · Mathematics 2013-03-20 Bing Li , Tomas Persson , Baowei Wang , Jun Wu

We consider a sequence of finite quantum graphs with few loops, so that they converge, in the sense of Benjamini-Schramm, to a random infinite quantum tree. We assume these quantum trees are spectrally delocalized in some interval $I$, in…

Mathematical Physics · Physics 2021-02-09 Nalini Anantharaman , Maxime Ingremeau , Mostafa Sabri , Brian Winn

A task is randomly drawn from a finite set of tasks and is described using a fixed number of bits. All the tasks that share its description must be performed. Upper and lower bounds on the minimum $\rho$-th moment of the number of performed…

Information Theory · Computer Science 2014-10-07 Christoph Bunte , Amos Lapidoth

This paper studies higher index theory for a random sequence of bounded degree, finite graphs with diameter tending to infinity. We show that in a natural model for such random sequences the following hold almost surely: the coarse…

K-Theory and Homology · Mathematics 2014-04-28 Rufus Willett

Scaling the amount of compute used to train language models has dramatically improved their capabilities. However, when it comes to inference, we often limit models to making only one attempt at a problem. Here, we explore inference compute…

Machine Learning · Computer Science 2025-01-03 Bradley Brown , Jordan Juravsky , Ryan Ehrlich , Ronald Clark , Quoc V. Le , Christopher Ré , Azalia Mirhoseini

We study density thresholds that force a measurable set $E\subseteq\mathbb{R}^d$ to contain all sufficiently large similar copies of every $n$-point configuration. We prove a lower bound of the form $1-O((\log n)/n)$, which matches the…

Classical Analysis and ODEs · Mathematics 2026-04-21 Vjekoslav Kovač , Adian Anibal Santos Sepčić

We consider maps with tight boundaries, i.e. maps whose boundaries have minimal length in their homotopy class, and discuss the properties of their generating functions $T^{(g)}_{\ell_1,\ldots,\ell_n}$ for fixed genus $g$ and prescribed…

Combinatorics · Mathematics 2026-02-11 Jérémie Bouttier , Emmanuel Guitter , Grégory Miermont

We consider the maximal number of arbitrary points in a special fibre that can be simultaneously approached by points in one sequence of general fibres. Several results about this topological invariant and their applications describe the…

alg-geom · Mathematics 2008-02-03 Michal Kwiecinski , Piotr Tworzewski

This work contributes to the programme of studying effective versions of "almost everywhere" theorems in analysis and ergodic theory via algorithmic randomness. We determine the level of randomness needed for a point in a Cantor space $…

Logic · Mathematics 2016-05-10 Rodney G. Downey , Satyadev Nandakumar , Andre Nies