Related papers: Size of exceptional sets in weakly mixing systems
This paper is a continuation of the work by the same authors on the Cartan group equipped with the sub-Finsler $\ell_\infty$ norm. We start by giving a detailed presentation of the structure of bang-bang extremal trajectories. Then we prove…
In this paper, first we introduce a new mapping for finding a common fixed point of an infinite family of nonexpansive mappings then we consider iterative method for finding a common element of the set of fixed points of an infinite family…
We give new explicit constructions of several fundamental objects in linear-algebraic pseudorandomness and combinatorics, including lossless rank extractors, weak subspace designs, and strong $s$-blocking sets over finite fields. Our focus…
We study non-stationary stochastic processes arising from sequential dynamical systems built on maps with a neutral fixed points and prove the existence of Extreme Value Laws for such processes. We use an approach developed in \cite{FFV16},…
I prove several theorems concerning upward closure and amalgamation in the generic multiverse of a countable transitive model of set theory. Every such model $W$ has forcing extensions $W[c]$ and $W[d]$ by adding a Cohen real, which cannot…
For a compact metric space $X$ with a group $G$ acting on it continuously, an invariant random compact is a Borel probability measure on the space of nonempty compact subsets of $X$ that is invariant under the action of $G$. The action is…
Given a dynamical system with constrained outputs, the maximal admissible set (MAS) is defined as the set of all initial conditions such that the output constraints are satisfied for all time. It has been previously shown that for…
This paper deals with a modified iterative projection method for approximating a solution of the hierarchical fixed point problem for a sequene of nearly nonexpansive mappings with respect to a nonexpansive mapping. It is shown that under…
In this work, we consider a class of $n$-dimensional, $n\geq2$, piecewise linear discontinuous maps that can exhibit a new type of attractor, called a weird quasiperiodic attractor. While the dynamics associated with these attractors may…
Let $ T\colon[0,1]^d\to [0,1]^d $ be a piecewise expanding map with an absolutely continuous invariant measure $ \mu $. Let $ \{H_n\} $ be a sequence of hyperrectangles or hyperboloids centered at the origin. Denote by $ \mathcal R(\{H_n\})…
A strong $s$-blocking set in a projective space is a set of points that intersects each codimension-$s$ subspace in a spanning set of the subspace. We present an explicit construction of such sets in a $(k - 1)$-dimensional projective space…
The Johnson--Lindenstrauss (JL) lemma is a powerful tool for dimensionality reduction in modern algorithm design. The lemma states that any set of high-dimensional points in a Euclidean space can be flattened to lower dimensions while…
In this paper, we unify all know iterative methods by introducing a new explicit iterative scheme for approximation of common fixed points of finite families of total asymptotically $I$-nonexpansive mappings. Note that such a scheme…
The fundamental result of Li, Long, and Srinivasan on approximations of set systems has become a key tool across several communities such as learning theory, algorithms, computational geometry, combinatorics and data analysis. The goal of…
In this paper, we tackle the resolution of chance-constrained problems reformulated via Sample Average Approximation. The resulting data-driven deterministic reformulation takes the form of a large-scale mixed-integer program cursed with…
The purpose of this short problem paper is to raise an extremal question on set systems which seems to be natural and appealing. Our question is: which set systems of a given size maximise the number of $(n+1)$-element chains in the power…
We study point sets arising from cut-and-project constructions. An important class is weak model sets, which include squarefree numbers and visible lattice points. For such model sets, we give a non-trivial upper bound on their pattern…
Tree-shaped graphical models are widely used for their tractability. However, they unfortunately lack expressive power as they require committing to a particular sparse dependency structure. We propose a novel class of generative models…
We develop numerical tools for Diagrammatic Monte-Carlo simulations of non-Abelian lattice field theories in the t'Hooft large-N limit based on the weak-coupling expansion. First we note that the path integral measure of such theories…
We use Arveson's notion of strongly peaking representation to generalize uniqueness theorems for free spectrahedra and matrix convex sets which admit minimal presentations. A fully compressed separable operator system necessarily generates…