Related papers: Linear repetitivity and subadditive ergodic theore…
We show a one-to-one correspondence between Toeplitz arrays over residually finite topological groups and model sets obtained via specific cut and project schemes, built from the odometer associated to the Toeplitz array. As an application,…
Given a n-dimensional lamination endowed with a Riemannian metric, we introduce the notion of a multiplicative cocycle of rank d, where n and d are arbitrary positive integers. The holonomy cocycle of a foliation and its exterior powers as…
We form a sequence of oblong matrices by evaluating an integrable vector-valued function along the orbit of an ergodic dynamical system. We obtain an almost sure asymptotic result for the permanents of those matrices. We also give an…
Subshifts are sets of colorings of $\mathbb{Z}^d$ defined by families of forbidden patterns. In a given subshift, the extender set of a finite pattern is the set of all its admissible completions. Since soficity of $\mathbb{Z}$ subshifts is…
We establish a "diagonal" ergodic theorem involving the additive and multiplicative groups of a countable field $K$ and, with the help of a new variant of Furstenberg's correspondence principle, prove that any "large" set in $K$ contains…
While routinely used in other areas of dynamics, image sets are ill-defined objects in general non-invertible measurable dynamics. We propose a way of consistently working with image sets of null-preserving (and hence, in particular, of…
In this paper we investigate connections between linear sets and subspaces of linear maps. We give a geometric interpretation of the results of [18, Section 5] on linear sets on a projective line. We extend this to linear sets in arbitrary…
The classical Besicovitch-Federer projection theorem implies that the d-dimensional Hausdorff measure of a set in Euclidean space with non-negligible d-unrectifiable part will strictly decrease under orthogonal projection onto almost every…
The paper is organized as a self-contained literate Prolog program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmetic encodings. The complete Prolog code is available at…
We settle the existence of certain "anti-magic" cubes using combinatorial block designs and graph decompositions to align a handful of small examples.
We develop a general framework for working with structured lifting problems, establishing closure and uniqueness properties of their solutions. In a subsequent paper, we apply these results to axiomatize computation rules of cubical type…
A type of iterative orthogonally accumulated projection methods for solving linear system of equations are proposed in this paper. This type of methods are applications of accumulated projection(AP) technique proposed recently by authors.…
We study the cohomology and hence $K$-theory of the aperiodic tilings formed by the so called 'cut and project' method, i.e., patterns in $d$ dimensional Euclidean space which arise as sections of higher dimensional, periodic structures.…
We establish linear convergence rates for a certain class of extrapolated fixed point algorithms which are based on dynamic string-averaging methods in a real Hilbert space. This applies, in particular, to the extrapolated simultaneous and…
We study the duality of reconstruction systems, which are $g$-frames in a finite dimensional setting. These systems allow redundant linear encoding-decoding schemes implemented by the so-called dual reconstruction systems. We are…
A commutative diagram that connects the basic objects of commutative algebra with the main objects of commutative analysis is constructed. Namely, with the help of five types of canonical embeddings we constructed a diagram between two sets…
Graph transformers typically embed every node in a single Euclidean space, blurring heterogeneous topologies. We prepend a lightweight Riemannian mixture-of-experts layer that routes each node to various kinds of manifold, mixture of…
The problem of finding a point in the intersection of closed sets can be solved by the method of alternating projections and its variants. It was shown in earlier papers that for convex sets, the strategy of using quadratic programming (QP)…
There exist cubical transition systems containing cubes having an arbitrarily large number of faces. A regular transition system is a cubical transition system such that each cube has the good number of faces. The categorical and…
Linear topological spaces with partial ordering (linear kinematics) are studied. They are defined by a set of 8 axioms implying that topology, linear structure and ordering are compatible with each other. Most of the results are valid for…