Related papers: Linear repetitivity and subadditive ergodic theore…
We prove some properties of analytic multiplicative and sub-multiplicative cocycles. The results allow to construct natural invariant analytic sets associated to complex dynamical systems.
Let $X$ be an integral projective variety of codimension two, degree $d$ and dimension $r$ and $Y$ be its general hyperplane section. The problem of lifting generators of minimal degree $\sigma$ from the homogeneous ideal of $Y$ to the…
A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…
We investigate cut-elimination and cut-simulation in impredicative (higher-order) logics. We illustrate that adding simple axioms such as Leibniz equations to a calculus for an impredicative logic -- in our case a sequent calculus for…
We give a short combinatorial proof of the classical pointwise ergodic theorem for probability measure preserving $\mathbb{Z}$-actions. Our approach reduces the theorem to a tiling problem: tightly tile each orbit by intervals with desired…
We construct higher categories of iterated spans, possibly equipped with extra structure in the form of "local systems", and classify their fully dualizable objects. By the Cobordism Hypothesis, these give rise to framed topological quantum…
We use the measurable Hall's theorem due to Cie\'sla and Sabok to prove that (i) if two measurable sets $A,B \subset \mathbb{R}^d$ of the same measure are bounded remainder sets with respect to a given irrational $d$-dimensional vector…
Continual learning systems operating in fixed-dimensional spaces face a fundamental geometric barrier: the flat manifold problem. When experience is represented as a linear trajectory in Euclidean space, the geodesic distance between…
Results concerning recurrence and ergodicity are proved in an abstract Hilbert space setting based on the proof of Khintchine's recurrence theorem for sets, and on the Hilbert space characterization of ergodicity. These results are carried…
A dual approach to defining the triangle sequence (a type of multidimensional continued fraction algorithm, initially developed in NT/9906016) for a pair of real numbers is presented, providing a new, clean geometric interpretation of the…
We present an application of the recently developed ergodic theoretic machinery on scenery flows to a classical geometric measure theoretic problem in Euclidean spaces. We also review the enhancements to the theory required in our work. Our…
We present cut and project formalism based on measures and continuous weight functions of sufficiently fast decay. The emerging measures are strongly almost periodic. The corresponding dynamical systems are compact groups and homomorphic…
This paper designs an alogrithm to compute the minimal combinations of finite sets in Euclidean spaces, and applys the algorithm of study the moment maps and geometric invariant stability of hypersurfaces. The classical example of cubic…
We give characterizations of unital uniform topological algebras and saturated locally multiplicatively convex algebras by means of multiplicative linear functionals. Some automatic continuity theorems in advertibly complete uniform…
Many complex systems involve interactions between more than two agents. Hypergraphs capture these higher-order interactions through hyperedges that may link more than two nodes. We consider the problem of embedding a hypergraph into…
We analyse the axioms of Euclidean geometry according to standard object-oriented software development methodology. We find a perfect match: the main undefined concepts of the axioms translate to object classes. The result is a suite of C++…
This note contains a solution to the following problem: reconstruct the definition field and the equation of a projective cubic surface, using only combinatorial information about the set of its rational points. This information is encoded…
In this paper we extend recent results of Fiorini et al. on the extension complexity of the cut polytope and related polyhedra. We first describe a lifting argument to show exponential extension complexity for a number of NP-complete…
We investigate uniform ergodic type theorems for additive and subadditive functions on a subshift over a finite alphabet. We show that every strictly ergodic subshift admits a uniform ergodic theorem for Banach-space-valued additive…
Designing complex engineered systems requires managing tightly coupled trade-offs between subsystem capabilities and resource requirements. Monotone co-design provides a compositional language for such problems, but its generality does not…