English
Related papers

Related papers: Regular Finite Decomposition Complexity

200 papers

We consider a family of gradient Gaussian vector fields on the torus $(\mathbb{Z}/L^N\mathbb{Z})^d$. Adams, Koteck\'{y}, M\"{u}ller and independently Bauerschmidt established the existence of a uniform finite range decomposition of the…

Mathematical Physics · Physics 2018-11-15 Simon Buchholz

The notion of the decomposition complexity was introduced in \cite{GTY} using a game theoretical approach. We introduce a notion of straight decomposition complexity and compare it with the original as well with the asymptotic property C.…

Metric Geometry · Mathematics 2017-04-05 Alexander Dranishnikov , Michael Zarichnyi

In this paper we study various aspects of porosities for conformal fractals. We first explore porosity in the general context of infinite graph directed Markov systems (GDMS), and we show that, under some natural assumptions, their limit…

Dynamical Systems · Mathematics 2023-06-22 Vasileios Chousionis , Mariusz Urbański

We consider substitution tilings and Delone sets without the assumption of finite local complexity (FLC). We first give a sufficient condition for tiling dynamical systems to be uniquely ergodic and a formula for the measure of cylinder…

Dynamical Systems · Mathematics 2019-10-18 Jeong-Yup Lee , Boris Solomyak

We introduce properties of metric spaces and, specifically, finitely generated groups with word metrics which we call coarse coherence and coarse regular coherence. They are geometric counterparts of the classical algebraic notion of…

K-Theory and Homology · Mathematics 2020-02-17 Boris Goldfarb , Jonathan L. Grossman

New homotopy invariant finiteness conditions on modules over commutative rings are introduced, and their properties are studied systematically. A number of finiteness results for classical homological invariants like flat dimension,…

Commutative Algebra · Mathematics 2007-05-23 W. Dwyer , J. P. C. Greenlees , S. Iyengar

The theory of finitely supported algebraic structures is related to Pitts theory of nominal sets (by equipping finitely supported sets with finitely supported internal algebraic laws). It represents a reformulation of Zermelo Fraenkel set…

Logic · Mathematics 2019-02-27 Andrei Alexandru , Gabriel Ciobanu

We consider deformations of bounded complexes of modules for a profinite group G over a field of positive characteristic. We prove a finiteness theorem which provides some sufficient conditions for the versal deformation of such a complex…

Number Theory · Mathematics 2013-09-03 Frauke M. Bleher , Ted Chinburg

Coboundary expansion (with $\mathbb{F}_2$ coefficients), and variations on it, have been the focus of intensive research in the last two decades. It was used to study random complexes, property testing, and above all Gromov's topological…

Group Theory · Mathematics 2024-04-02 Michael Chapman , Alexander Lubotzky

We survey the development and status quo of a subject best described as "generic representation theory of finite dimensional algebras", which started taking shape in the early 1980s. Let $\Lambda$ be a finite dimensional algebra over an…

Representation Theory · Mathematics 2019-12-20 K. R. Goodearl , B. Huisgen-Zimmermann

For any dynamical system $T:X\rightarrow X$ of a compact metric space $X$ with $g-$almost product property and uniform separation property, under the assumptions that the periodic points are dense in $X$ and the periodic measures are dense…

Dynamical Systems · Mathematics 2015-11-19 Xueting Tian

The parametric complexity is the key quantity in the minimum description length (MDL) approach to statistical model selection. Rissanen and others have shown that the parametric complexity of a statistical model approaches a simple function…

Information Theory · Computer Science 2015-10-30 James G. Dowty

Reynolds' theory of relational parametricity formalizes parametric polymorphism for System F, thus capturing the idea that polymorphically typed System F programs always map related inputs to related results. This paper shows that Reynolds'…

Logic in Computer Science · Computer Science 2017-01-24 Patricia Johann , Kristina Sojakova

In "Random complex fewnomials, I," B. Shiffman and S. Zelditch determine the limiting formula as N goes to infinity of the (normalized) expected distribution of complex zeros of a system of k random n-nomials in m variables where the…

Complex Variables · Mathematics 2013-12-02 Timothy Tran

In this article we prove some previously announced results about metric ultraproducts of finite simple groups. We show that any non-discrete metric ultraproduct of alternating or special linear groups is a geodesic metric space. For more…

Group Theory · Mathematics 2016-06-14 Andreas Thom , John Wilson

In this paper we investigate finiteness properties of totally disconnected locally compact groups for general commutative rings $R$, in particular for $R = \mathbb{Z}$ and $R= \mathbb{Q}$. We show these properties satisfy many analogous…

Group Theory · Mathematics 2021-01-22 Ilaria Castellano , Ged Corob Cook

A new concept, decomposition-unstable (DU) variety of a parametric polynomial system, is introduced in this paper and the stabilities of several triangular decomposition methods, such as characteristic set decomposition, relatively…

Symbolic Computation · Computer Science 2012-08-31 Xiaoxian Tang , Bican Xia

This work is devoted to the so-called filtration theory of semigroup generators in the unit disk. It should be noted that numerous filtrations studied to nowdays have been introduced for different purposes and considered from different…

Complex Variables · Mathematics 2023-06-14 Mark Elin , Fiana Jacobzon

This paper is an exposition, with some new applications, of our results on the growth of entropy of convolutions. We explain the main result on $\mathbb{R}$, and derive, via a linearization argument, an analogous result for the action of…

Dynamical Systems · Mathematics 2017-06-07 Michael Hochman

We introduce a novel concept of rank for subsets of finite metric spaces E^n_q (the set of all n-dimensional vectors over an alphabet of size q) equipped with the Hamming distance, where the rank R(A) of a subset A is defined as the number…

Discrete Mathematics · Computer Science 2025-06-17 Jamolidin K. Abdurakhmanov
‹ Prev 1 3 4 5 6 7 10 Next ›