English
Related papers

Related papers: Constructive Dimension and Turing Degrees

200 papers

We define a congruence module $\Psi_A(M)$ associated to a surjective $\mathcal O$-algebra morphism $\lambda\colon A \to \mathcal{O}$, with $\mathcal{O}$ a discrete valuation ring, $A$ a complete noetherian local $\mathcal{O}$-algebra…

Number Theory · Mathematics 2024-11-26 Srikanth B. Iyengar , Chandrashekhar B. Khare , Jeffrey Manning

We construct a nonrecursive set \(A\le_T\emptyset'\) and a uniformly computable family of sets \(C_0,C_1,\dots\), all bounded finite-one equivalent to \(A\), such that the corresponding \(1\)-degrees form a copy of the dense linear order…

Logic · Mathematics 2026-03-31 Patrizio Cintioli

We introduce the nuclear dimension of a C*-algebra; this is a noncommutative version of topological covering dimension based on a modification of the earlier concept of decomposition rank. Our notion behaves well with respect to inductive…

Operator Algebras · Mathematics 2009-03-31 Wilhelm Winter , Joachim Zacharias

In this paper, we prove that if $S\subseteq\mathbb{R}^d$ is hyperplane absolute winning on a closed hyperplane diffuse set $L\subseteq\mathbb{R}^d$, then $\mathrm{dim}_H S\cap K=\mathrm{dim}_H K$ for any irreducible self-conformal set…

Dynamical Systems · Mathematics 2025-12-09 Junjie Huang , Bing Li , Bo Wang , Na Yuan

We compute the Hausdorff dimension of sets defined by the growth of weighted products of multiple digits at arbitrary positions in $d$-decaying Gauss-like iterated function systems. We provide the complete Hausdorff dimensional result for…

Dynamical Systems · Mathematics 2025-12-03 Ayreena Bakhtawar , Michał Rams

To preserve previously learned representations, continual learning systems must strike a balance between plasticity, the ability to acquire new knowledge, and stability. This stability-plasticity dilemma affects how representations can be…

Machine Learning · Computer Science 2026-05-01 Kathrin Korte , Joachim Winter Pedersen , Eleni Nisioti , Sebastian Risi

Linear extended top-down tree transducers (or synchronous tree-substitution grammars) are popular formal models of tree transformations. The expressive power of compositions of such transducers with and without regular look-ahead is…

Formal Languages and Automata Theory · Computer Science 2013-01-09 Zoltán Fülöp , Andreas Maletti

Let $C$ be a linear code of length $n$ and dimension $k$ over the finite field $\mathbb{F}_{q^m}$. The trace code $\mathrm{Tr}(C)$ is a linear code of the same length $n$ over the subfield $\mathbb{F}_q$. The obvious upper bound for the…

Information Theory · Computer Science 2023-09-06 Márton Erdélyi , Pál Hegedüs , Sándor Z. Kiss , Gábor P. Nagy

We describe a method to express the susceptibility and higher derivatives of the free energy in terms of the scaling variables (Wegner's nonlinear scaling fields) associated with the high-temperature (HT) fixed point of Dyson hierarchical…

Statistical Mechanics · Physics 2009-11-10 Y. Meurice

This paper studies higher index theory for a random sequence of bounded degree, finite graphs with diameter tending to infinity. We show that in a natural model for such random sequences the following hold almost surely: the coarse…

K-Theory and Homology · Mathematics 2014-04-28 Rufus Willett

In this article, we give a full description of a topological many-one degree structure of real-valued functions, recently introduced by Day-Downey-Westrick. We also point out that their characterization of the Bourgain rank of a Baire-one…

Logic · Mathematics 2019-06-26 Takayuki Kihara

We say that a topological space $X$ is selectively highly divergent (SHD) if for every sequence of non-empty open sets $\{U_n\mid n\in\omega \}$ of $X$, we can find $x_n\in U_n$ such that the sequence $(x_n)$ has no convergent subsequences.…

We present strong versions of Marstrand's projection theorems and other related theorems. For example, if E is a plane set of positive and finite s-dimensional Hausdorff measure, there is a set X of directions of Lebesgue measure 0, such…

Metric Geometry · Mathematics 2015-11-19 Kenneth Falconer , Pertti Mattila

Structural resolution (or S-resolution) is a newly proposed alternative to SLD-resolution that allows a systematic separation of derivations into term-matching and unification steps. Productive logic programs are those for which…

Logic in Computer Science · Computer Science 2015-06-23 Peng Fu , Ekaterina Komendantskaya

Hausdorff $\Phi$-dimension is a notion of Hausdorff dimension developed using a restricted class of coverings of a set. We introduce an effective version of Hausdorff $\Phi$-dimension, which we call constructive $\Phi$-dimension. We prove a…

Information Theory · Computer Science 2026-05-01 Satyadev Nandakumar , Subin Pulari , Akhil S

We show that for a wide range of probability measures, constructive gales are interchangable with constructive supergales for defining constructive Hausdorff dimension, thus generalizing a previous independent result of Hitchcock…

Computational Complexity · Computer Science 2007-05-23 Stephen A. Fenner

We establish sharp bounds for the Hausdorff dimension of sets of irrational numbers in $(0,1)$ whose digits in the $N$-expansion are either uniformly bounded or tend to infinity. For sets with digits bounded by an integer $M \ge N$, we…

Number Theory · Mathematics 2026-03-31 Andreea Catalina Chitu , Gabriela Ileana Sebe , Dan Lascu

We give a complete classification of the infinite dimensional tilting modules over a tame hereditary algebra R. We start our investigations by considering tilting modules of the form T=R_U\oplus R_U /R where U is a union of tubes, and R_U…

Representation Theory · Mathematics 2011-12-06 Lidia Angeleri Hügel , Javier Sánchez

This paper contains a comparative study of two families of simple curves drawn in the plane. On the one hand, we have the fractal curves on the unit interval, with self-similar structure, which have associated a Hausdorff dimension. On the…

Classical Analysis and ODEs · Mathematics 2015-04-07 R. Hansen , M. Piacquadio

Let $G=(V,E)$ be a graph. A set of vertices $A$ is an incidence generator for $G$ if for any two distinct edges $e,f\in E(G)$ there exists a vertex from $A$ which is an endpoint of either $e$ or $f$. The smallest cardinality of an incidence…

Combinatorics · Mathematics 2018-11-09 Dragana Bozovic , Aleksander Kelenc , Iztok Peterin , Ismael G. Yero