Related papers: Linear repetitivity and subadditive ergodic theore…
Jigsaw puzzle solving, the problem of constructing a coherent whole from a set of non-overlapping unordered visual fragments, is fundamental to numerous applications, and yet most of the literature of the last two decades has focused thus…
We prove mean and pointwise ergodic theorems for the action of a discrete lattice subgroup in a connected algebraic Lie group, on infinite volume homogeneous algebraic varieties. Under suitable necessary conditions, our results are…
We introduce a new formalism and a number of new results in the context of geometric computational vision. The classical scope of the research in geometric computer vision is essentially limited to static configurations of points and lines…
We compute the Hausdorff dimension of sets of very well approximable vectors on rational quadrics. We use ubiquitous systems and the geometry of locally symmetric spaces. As a byproduct we obtain the Hausdorff dimension of the set of rays…
The Euclidean projection onto a convex set is an important problem that arises in numerous constrained optimization tasks. Unfortunately, in many cases, computing projections is computationally demanding. In this work, we focus on…
The classical theory of plane projective geometry is examined constructively, using both synthetic and analytic methods. The topics include Desargues's Theorem, harmonic conjugates, projectivities, involutions, conics, Pascal's Theorem,…
We give a simple computational approach to mathematical quasicrystals, combining cut-and-project methods with self-similarity. Starting with a Pisot unit $\beta$ and an iterated function system $g_k(z)=\beta z +z_k, \ k=1,...,m$ in a…
We describe a provably complete algorithm for the generation of a tight, possibly exact superset of all combinatorially distinct simple n-facet polytopes in R^d, along with their graphs, f-vectors, and face lattices. The technique applies…
The goal of this paper is to generalize the main results of [KM] and subsequent papers on metric Diophantine approximation with dependent quantities to the set-up of systems of linear forms. In particular, we establish `joint strong…
This paper uses a connection between bounded remainder sets in $\mathbb{R}^d$ and cut-and-project sets in $\mathbb{R}$ together with the fact that each one-dimensional Pisot substitution sequence is bounded distance equivalent to some…
A rather general ergodic type scheme is presented on arbitrary sets X, as they are generated by arbitrary mappings T : X \longrightarrow X. The structures considered on X are given by suitable subsets of the set of all of its finite…
Given a subshift over an arbitrary alphabet, we construct a representation of the associated unital algebra. We describe a criteria for the faithfulness of this representation in terms of the existence of cycles with no exits. Subsequently,…
We consider the popular and classical method of alternating projections for finding a point in the intersection of two closed sets. By situating the algorithm in a metric space, equipped only with well-behaved geodesics and angles (in the…
We describe (infinite-dimensional) irreducible representations of the crossed product C$^*$-algebra associated with a topological dynamical system (based on $Z$) and we show that their restrictions to the underling $\ell^1$-Banach…
Cut generation and lifting are key components for the performance of state-of-the-art mathematical programming solvers. This work proposes a new general cut-and-lift procedure that exploits the combinatorial structure of 0-1 problems via a…
We study the asymptotic properties of the trajectories of a discrete-time random dynamical system in an infinite-dimensional Hilbert space. Under some natural assumptions on the model, we establish a multiplica-tive ergodic theorem with an…
We consider the problem of projecting a convex set onto a subspace, or equivalently formulated, the problem of computing a set obtained by applying a linear mapping to a convex feasible set. This includes the problem of approximating convex…
The nature and origin of exceptional sets associated with the rotation number of circle maps, Kolmogorov-Arnol'd-Moser theory on the existence of invariant tori and the linearisation of complex diffeomorphisms are explained. The metrical…
This is the first paper in a series of eight where in the first three we develop a systematic approach to the geometric algebras of multivectors and extensors, followed by five papers where those algebraic concepts are used in a novel…
The thesis presents the subject of synthetic topology, especially with relation to metric spaces. A model of synthetic topology is a categorical model in which objects possess an intrinsic topology in a suitable sense, and all morphisms are…