English
Related papers

Related papers: The Arithmetical Complexity of Dimension and Rando…

200 papers

This paper contains new results on two classical topics in fractal geometry: projections, and intersections with affine planes. To keep the notation of the abstract simple, we restrict the discussion to the planar cases of our theorems. Our…

Classical Analysis and ODEs · Mathematics 2016-07-27 Pertti Mattila , Tuomas Orponen

Let T be a tilting object in a triangulated category equivalent to the bounded derived category of a hereditary abelian category with finite dimensional homomorphism spaces and split idempotents. This text investigates the strong global…

Representation Theory · Mathematics 2017-03-17 Edson Ribeiro Alvares , Patrick Le Meur , Eduardo N. Marcos

Decomposition and abstraction is an essential component of computational thinking, yet it is not always emphasized in introductory programming courses. In addition, as generative AI further reduces the focus on syntax and increases the…

Software Engineering · Computer Science 2025-12-09 Georgiana Haldeman , Peter Ohmann , Paul Denny

This paper investigates the effective categoricity of ultrahomogeneous structures. It is shown that any computable ultrahomogeneous structure is $\Delta^0_2$ categorical. A structure A is said to be weakly ultrahomogeneous if there is a…

Logic · Mathematics 2016-08-04 Francis Adams , Douglas Cenzer

Let $E\subset\rr$ be a closed set of Hausdorff dimension $\alpha$. We prove that if $\alpha$ is sufficiently close to 1, and if $E$ supports a probabilistic measure obeying appropriate dimensionality and Fourier decay conditions, then $E$…

Classical Analysis and ODEs · Mathematics 2013-06-11 Izabella Laba , Malabika Pramanik

Recently there has been considerable interest in studying the length and the depth of finite groups, algebraic groups and Lie groups. In this paper we introduce and study similar notions for algebras. Let $k$ be a field and let $A$ be an…

Rings and Algebras · Mathematics 2021-03-24 Damian Sercombe , Aner Shalev

The modular discriminant $\Delta$ is known to structure the sequence of modular forms $(M_{2k}(SL_2(\mathbb{Z})))_{k\in \; \mathbb{N}^*}$ at level $1$.\\ For all positive integer $N$, we define a strong modular unit $\Delta_N$ at level $N$…

Number Theory · Mathematics 2018-08-31 Jean-Christophe Feauveau

We show that a finite dimensional algebra $A$ has dominant dimension at least $n \geq 2$ if and only if the regular bimodule $A$ is $n$-torsionfree if and only if $A \cong \Omega^{n}(\text{Tr}(\Omega^{n-2}(V)))$ as $A$-bimodules, where…

Representation Theory · Mathematics 2020-05-19 Rene Marczinzik

In this work we investigate the Weihrauch degree of the problem $\mathsf{DS}$ of finding an infinite descending sequence through a given ill-founded linear order, which is shared by the problem $\mathsf{BS}$ of finding a bad sequence…

Logic · Mathematics 2024-01-31 Jun Le Goh , Arno Pauly , Manlio Valenti

A dimension group is an ordered abelian group that is an inductive limit of a sequence of simplicial groups, and a stationary dimension group is such an inductive limit in which the homomorphism is the same at every stage. If a simple…

Group Theory · Mathematics 2015-07-14 Gregory R. Maloney

We fix a positive integer $M$, and we consider expansions in arbitrary real bases $q>1$ over the alphabet $\{0,1,...,M\}$. We denote by $U_q$ the set of real numbers having a unique expansion. Completing many former investigations, we give…

Number Theory · Mathematics 2015-03-03 Vilmos Komornik , Derong Kong , Wenxia Li

Based on the work of Abercrombie, Barnea and Shalev gave an explicit formula for the Hausdorff dimension of a group acting on a rooted tree. We focus here on the binary tree T. Abert and Virag showed that there exist finitely generated (but…

Group Theory · Mathematics 2008-09-05 Olivier Siegenthaler

We give tight bounds on the relation between the primal and dual of various combinatorial dimensions, such as the pseudo-dimension and fat-shattering dimension, for multi-valued function classes. These dimensional notions play an important…

Combinatorics · Mathematics 2021-08-24 Pieter Kleer , Hans Simon

We use the Sigma^1_3 absoluteness theorem to show that the complexity of the statement "(omega,E)$ is isomorphic to an initial segment of the core model" is Pi^1_4, and that the complexity of the statement "(omega,E)$ is isomorphic to a…

Logic · Mathematics 2016-09-06 William J. Mitchell

We prove three results on the dimension structure of complexity classes. 1. The Point-to-Set Principle, which has recently been used to prove several new theorems in fractal geometry, has resource-bounded instances. These instances…

Computational Complexity · Computer Science 2021-09-14 Jack H. Lutz , Neil Lutz , Elvira Mayordomo

A differential algebra of finite type over a field k is a filtered algebra A, such that the associated graded algebra is finite over its center, and the center is a finitely generated k-algebra. The prototypical example is the algebra of…

Rings and Algebras · Mathematics 2007-05-23 Amnon Yekutieli , James J. Zhang

To every object $X$ of a symmetric tensor category over a field of characteristic $p>0$ we attach $p$-adic integers $\text{Dim}_+(X)$ and $\text{Dim}_-(X)$ whose reduction modulo $p$ is the categorical dimension $\text{dim}(X)$ of $X$,…

Representation Theory · Mathematics 2020-05-27 Pavel Etingof , Nate Harman , Victor Ostrik

For every $n \geq 1$, we present examples of algebras $A$ having dominant dimension $n$, such that the algebra $B=End_A(I_0 \oplus \Omega^{-n}(A))$ has dominant dimension different from $n$, where $I_0$ is the injective hull of $A$. This…

Representation Theory · Mathematics 2016-08-08 Rene Marczinzik

The classification of all Hopf algebras of a given finite dimension over an algebraically closed field of characteristic 0 is a difficult problem. If the dimension is a prime, then the Hopf algebra is a group algebra. If the dimension is…

Quantum Algebra · Mathematics 2018-06-01 Margaret Beattie , Gaston Andres Garcia

We propose a novel class of kernels to alleviate the high computational cost of large-scale nonparametric learning with kernel methods. The proposed kernel is defined based on a hierarchical partitioning of the underlying data domain, where…

Machine Learning · Computer Science 2017-08-15 Jie Chen , Haim Avron , Vikas Sindhwani
‹ Prev 1 3 4 5 6 7 10 Next ›