Related papers: Linear repetitivity and subadditive ergodic theore…

Projection algorithms are well known for their simplicity and flexibility in solving feasibility problems. They are particularly important in practice due to minimal requirements for software implementation and maintenance. In this work, we…

For any irrational cut-and-project setup, we demonstrate a natural infinite family of windows which gives rise to separated nets that are each bounded distance to a lattice. Our proof provides a new construction, using a sufficient…

We show that linearly repetitive weighted Delone sets in groups of polynomial growth have a uniquely ergodic hull. This result applies in particular to the linearly repetitive weighted Delone sets in homogeneous Lie groups constructed in…

This article is devoted to the study of classical and new results concerning equidistant sets, both from the topological and metric point of view. We start with a review of the most interesting known facts about these sets in the euclidean…

In this paper we explore the design of sequent calculi operating on graphs. For this purpose, we introduce a set of logical connectives allowing us to extend the correspondence between cographs and classical propositional formulas to any…

This article surveys the mathematics of the cut and project method as applied to point sets, called here {\em model sets}. It covers the geometric, arithmetic, and analytical sides of this theory as well as diffraction and the connection…

We show that any translate of a model set is a model set in some modified cut-and-project scheme. Restricting to Euclidean direct space, we show that any translate of an inter model set is a model set in some modified cut-and-project scheme…

Using linear projections one gets new inequalities for the successive minima of the lattice of sections of an hermitian line bundle on an arithmetic surface.

Given an Euclidean space, this paper elucidates the topological link between the partial derivatives of the Minkowski functional associated to a set (assumed to be compact, convex, with a differentiable boundary and a non-empty interior)…

We establish results with an arithmetic flavor that generalize the polynomial multidimensional Szemeredi theorem and related multiple recurrence and convergence results in ergodic theory. For instance, we show that in all these statements…

We provide a framework for studying randomly coloured point sets in a locally compact, second-countable space on which a metrisable unimodular group acts continuously and properly. We first construct and describe an appropriate dynamical…

The semi-invertible version of Oseledets' multiplicative ergodic theorem providing a decomposition of the underlying state space of a random linear dynamical system into fast and slow spaces is deduced for a strongly measurable cocycle on a…

Quasiperiodic arrangements of the constitutive materials in composites result in effective properties with very unusual electromagnetic and elastic properties. The paper discusses the cut-and-projection method that is used to characterize…

By employing an accelerated weighting method, we establish arbitrary polynomial and exponential pointwise convergence for multiple ergodic averages under general balancing conditions in both discrete and continuous settings, including…

In this paper we propose an elementary topological approach which unifies and extends various different results concerning fixed points and periodic points for maps defined on sets homeomorphic to rectangles embedded in euclidean spaces. We…

We generalise the Elekes-Szab\'o theorem to arbitrary arity and dimension and characterise the complex algebraic varieties without power saving. The characterisation involves certain algebraic subgroups of commutative algebraic groups…

Cut-and-project sets $\Sigma\subset\mathbb{R}^n$ represent one of the types of uniformly discrete relatively dense sets. They arise by projection of a section of a higher-dimensional lattice to a suitably oriented subspace. Cut-and-project…

Compact sets in constructive mathematics capture our intuition of what computable subsets of the plane (or any other complete metric space) ought to be. A good representation of compact sets provides an efficient means of creating and…

The aims of this article are two-fold. First, we give a geometric characterization of the optimal basic solutions of the general linear programming problem (no compactness assumptions) and provide a simple, self-contained proof of it…

We discuss some classical and recent results and open problems on the statistical behavior of ergodic sums above toral translations, and their applications to Diophantine approximations and to ergodic properties of systems related to…