English
Related papers

Related papers: Odometers in non-compact spaces

200 papers

We establish a quantitative isoperimetric inequality for weighted Riemannian manifolds with $\mathrm{Ric}_{\infty} \ge 1$. Precisely, we give an upper bound of the volume of the symmetric difference between a Borel set and a sub-level (or…

Differential Geometry · Mathematics 2022-02-08 Cong Hung Mai , Shin-ichi Ohta

Differential calculus on discrete sets is developed in the spirit of noncommutative geometry. Any differential algebra on a discrete set can be regarded as a `reduction' of the `universal differential algebra' and this allows a systematic…

High Energy Physics - Theory · Physics 2009-10-28 A. Dimakis , F. Müller-Hoissen

This work addresses the problem of computing measures of recognisable sets of infinite trees. An algorithm is provided to compute the probability measure of a tree language recognisable by a weak alternating automaton, or equivalently…

Formal Languages and Automata Theory · Computer Science 2025-12-22 Damian Niwiński , Marcin Przybyłko , Michał Skrzypczak

In the context of knowledge compilation (KC), we study the effect of augmenting Ordered Binary Decision Diagrams (OBDD) with two kinds of decomposition nodes, i.e., AND-vertices and OR-vertices which denote conjunctive and disjunctive…

Artificial Intelligence · Computer Science 2014-10-28 Yong Lai , Dayou Liu

By studying Cameron's operator in terms of determinants, two kinds of "integer" sequences of incomplete numbers were introduced. One was the sequence of restricted numbers, including $s$-step Fibonacci sequences. Another was the sequence of…

Number Theory · Mathematics 2022-01-03 Narakorn Rompurk Kanasri , Takao Komatsu , Vichian Laohakosol

We use the language of proper CAT(-1) spaces to study thick, locally compact trees, the real, complex and quaternionic hyperbolic spaces and the hyperbolic plane over the octonions. These are rank 1 Euclidean buildings, respectively rank 1…

Metric Geometry · Mathematics 2024-12-31 Isobel Davies

We deal with countable alphabet locally compact random subshifts of finite type (the latter merely meaning that the symbol space is generated by an incidence matrix) under the absence of Big Images Property and under the absence of uniform…

Dynamical Systems · Mathematics 2015-09-02 Volker Mayer , Mariusz Urbanski

This paper establishes a uniform procedure to split the operations in any algebraic operad, generalizing previous known notions of splitting algebraic structures from the dendriform algebra of Loday that splits the associative operation to…

Category Theory · Mathematics 2017-12-19 Jun Pei , Chengming Bai , Li Guo

An abstract system of congruences describes a way of partitioning a space into finitely many pieces satisfying certain congruence relations. Examples of abstract systems of congruences include paradoxical decompositions and $n$-divisibility…

Logic · Mathematics 2020-02-26 Clinton T. Conley , Andrew S. Marks , Spencer T. Unger

We generalize the concept of ascending and descending runs from permutations to rooted labelled trees and mappings, i.e., functions from the set $\{1, \dots, n\}$ into itself. A combinatorial decomposition of the corresponding functional…

Combinatorics · Mathematics 2020-07-06 Marie-Louise Lackner , Alois Panholzer

A special class of orthogonal rational functions (ORFs) is presented in this paper. Starting with a sequence of ORFs and the corresponding rational functions of the second kind, we define a new sequence as a linear combination of the…

Classical Analysis and ODEs · Mathematics 2010-09-01 K. Deckers , M. J. Cantero , L. Moral , L. Velazquez

Tree-like tableaux are objects in bijection with alternative or permutation tableaux. They have been the subject of a fruitful combinatorial study for the past few years. In the present work, we define and study a new subclass of tree-like…

We give a 'recursive' formula (in terms of reducible limits) for counting rational curves on a variety moving in any sufficiently large and well-behaved family. Our approach is completely elementary and makes no use of moduli spaces for…

alg-geom · Mathematics 2008-02-03 Ziv Ran

The theorem of factorisation forests shows the existence of nested factorisations -- a la Ramsey -- for finite words. This theorem has important applications in semigroup theory, and beyond. The purpose of this paper is to illustrate the…

Logic in Computer Science · Computer Science 2007-05-23 Thomas Colcombet

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

Discrete Mathematics · Computer Science 2017-08-08 Emmanuel Jeandel

We study the free (associative, non-commutative) Baxter algebra on one generator. The first explicit description of this object is due to Ebrahimi-Fard and Guo. We provide an alternative description in terms of a certain class of trees,…

Combinatorics · Mathematics 2007-05-23 Marcelo Aguiar , Walter Moreira

We provide a family of group measure space II_1 factors for which all finite index subfactors can be explicitly listed. In particular, the set of all indices of irreducible subfactors can be computed. Concrete examples show that this index…

Operator Algebras · Mathematics 2011-11-29 Steven Deprez , Stefaan Vaes

We prove a general result about the decomposition on ergodic components of group actions on boundaries of spherically homogeneous rooted trees. Namely, we identify the space of ergodic components with the boundary of the orbit tree…

Group Theory · Mathematics 2015-02-19 Rostislav Grigorchuk , Dmytro Savchuk

This paper studies infinite graphs produced from a natural unfolding operation applied to finite graphs. Graphs produced via such operations are of finite degree and automatic over the unary alphabet (that is, they can be described by…

Logic · Mathematics 2008-09-22 Bakhadyr Khoussainov , Jiamou Liu , Mia Minnes

We introduce a family of maps generating continued fractions where the digit $1$ in the numerator is replaced cyclically by some given non-negative integers $(N_1,\ldots,N_m)$. We prove the convergence of the given algorithm, and study the…

Dynamical Systems · Mathematics 2021-12-09 Karma Dajani , Niels Langeveld