English
Related papers

Related papers: The Arithmetical Complexity of Dimension and Rando…

200 papers

Let $\{X_n= e^{2\pi i \theta_n}\}$ be a sequence of Steinhaus random variables, where $\theta_n$ are independent and uniformly distributed on $[0,1]$. We compute the almost sure Hausdorff dimension of the images and graphs of the random…

Classical Analysis and ODEs · Mathematics 2026-03-09 Chun-Kit Lai , Ka-Sing Lau , Peng-Fei Zhang

Let At denote the set of infinite sequences of effective dimension t. We determine both how close and how far an infinite sequence of dimension s can be from one of dimension t, measured using the Besicovitch pseudometric. We also identify…

Logic · Mathematics 2023-08-08 Jun Le Goh , Joseph S. Miller , Mariya I. Soskova , Linda Westrick

It is shown that if $A$ is a Borel subset of the first Heisenberg group, with Hausdorff dimension satisfying $2< \dim A < 3$, then the packing dimensions of vertical projections of $A$ are almost surely not less than $\dim A$, where both…

Classical Analysis and ODEs · Mathematics 2026-03-10 Terence L. J. Harris

Let $X=\bigcup\varphi_{i}X$ be a strongly separated self-affine set in $\mathbb{R}^2$ (or one satisfying the strong open set condition). Under mild non-compactness and irreducibility assumptions on the matrix parts of the $\varphi_{i}$, we…

Metric Geometry · Mathematics 2017-12-21 Balázs Bárány , Michael Hochman , Ariel Rapaport

A set of integers $A$ is computably encodable if every infinite set of integers has an infinite subset computing $A$. By a result of Solovay, the computably encodable sets are exactly the hyperarithmetic ones. In this paper, we extend this…

Logic · Mathematics 2019-09-18 Benoit Monin , Ludovic Patey

Let $\alpha$ be an irrational real number. We show that the set of $\epsilon$-badly approximable numbers \[ \mathrm{Bad}^\varepsilon (\alpha) := \{x\in [0,1]\, : \, \liminf_{|q| \to \infty} |q| \cdot \| q\alpha -x \| \geq \varepsilon \} \]…

Number Theory · Mathematics 2018-05-29 Yann Bugeaud , Dong Han Kim , Seonhee Lim , Michał Rams

Using constructions of Hirsch and Hodkinson, we show that the class of strongly atom structures for various cylindric-like algebras is not elementary. This applies to diagonal free reducts and polyadic algebras with and without equality.…

Logic · Mathematics 2013-04-22 Tarek Sayed Ahmed , Mohamed Khalifa

We introduce a new framework for a descriptive complexity approach to arithmetic computations. We define a hierarchy of classes based on the idea of counting assignments to free function variables in first-order formulae. We completely…

Computational Complexity · Computer Science 2020-05-08 Arnaud Durand , Anselm Haak , Juha Kontinen , Heribert Vollmer

Let p be a fixed prime. An Abelian p-group is an Abelian group (not necessarily finitely generated) in which every element has for its order some power of p. The countable Abelian p-groups are classified by Ulm's theorem, and Khisamiev…

Logic · Mathematics 2008-05-14 W. Calvert , D. Cenzer , V. S. Harizanov , A. Morozov

We study a general procedure that builds random $\mathbb R$-trees by gluing recursively a new branch on a uniform point of the pre-existing tree. The aim of this paper is to see how the asymptotic behavior of the sequence of lengths of…

Probability · Mathematics 2016-12-19 Nicolas Curien , Bénédicte Haas

We study the number of (set-theoretically) defining equations of Segre products of projective spaces times certain projective hypersurfaces, extending results by Singh and Walther. Meanwhile, we prove some results about the cohomological…

Algebraic Geometry · Mathematics 2010-08-02 Matteo Varbaro

A new homological dimension is introduced to measure the quality of resolutions of `singular' finite dimensional algebras (of infinite global dimension) by `regular' ones (of finite global dimension). Upper bounds are established in terms…

Representation Theory · Mathematics 2017-06-27 Hongxing Chen , Ming Fang , Otto Kerner , Steffen Koenig , Kunio Yamagata

We extend the classical preferential attachment random graph model to random simplicial complexes. At each stage of the model, we choose one of the existing $k$-simplices with probability proportional to its $k$-degree. The chosen…

Probability · Mathematics 2024-10-24 Takashi Owada , Gennady Samorodnitsky

Binary idempotent semirings govern classical path algebras. Their multiplicative structure is dyadic. We examine whether this restriction is structural or accidental. We define ternary idempotent $\Gamma$-semirings as higher-arity ordered…

Rings and Algebras · Mathematics 2026-02-26 Chandrasekhar Gokavarapu , D. Madhusudhana Rao

We classify the computability-theoretic complexity of two index sets of classes of first-order theories: We show that the property of being an $\aleph_0$-categorical theory is $\Pi^0_3$-complete; and the property of being an Ehrenfeucht…

Logic · Mathematics 2007-05-23 Steffen Lempp , Theodore A. Slaman

The symmetric homology of a unital algebra $A$ over a commutative ground ring $k$ is defined using derived functors and the symmetric bar construction of Fiedorowicz. For a group ring $A = k[\Gamma]$, the symmetric homology is related to…

Algebraic Topology · Mathematics 2019-04-22 Shaun V. Ault

Any finite-dimensional commutative (associative) graded algebra with all nonzero homogeneous subspaces one-dimensional is defined by a symmetric coefficient matrix. This algebraic structure gives a basic kind of $A$-graded algebras…

Rings and Algebras · Mathematics 2026-03-23 Yunnan Li , Shi Yu

In this paper, we use resource-bounded dimension theory to investigate polynomial size circuits. We show that for every $i\geq 0$, $\Ppoly$ has $i$th order scaled $\pthree$-strong dimension 0. We also show that $\Ppoly^\io$ has…

Computational Complexity · Computer Science 2008-02-29 Xiaoyang Gu

A non-empty subset of a topological space is irreducible if whenever it is covered by the union of two closed sets, then already it is covered by one of them. Irreducible sets occur in proliferation: (1) every singleton set is irreducible,…

Logic in Computer Science · Computer Science 2016-10-04 Hadrian Andradi , Weng Kin Ho

We use entropy rates and Schur concavity to prove that, for every integer k >= 2, every nonzero rational number q, and every real number alpha, the base-k expansions of alpha, q+alpha, and q*alpha all have the same finite-state dimension…

Computational Complexity · Computer Science 2007-07-13 David Doty , Jack H. Lutz , Satyadev Nandakumar