相关论文: The Arithmetical Complexity of Dimension and Rando…
We introduce Backstr\"om pairs and Backstr\"om rings, study their derived categories and construct for them a sort of categorical resolutions. For the latter we define the global dimension, construct a sort of semi-orthogonal decomposition…
This paper is concerned with restricted families of projections in $\mathbb{R}^{3}$. Let $K \subset \mathbb{R}^{3}$ be a Borel set with Hausdorff dimension $\dim K = s > 1$. If $\mathcal{G}$ is a smooth and sufficiently well-curved…
The paper is devoted to give a full classification of all finite dimensional nilpotent Lie algebras $ L $ of class $4$ such that $ \dim L^2=3. $ Moreover, we classify the capable ones.
We consider four related problems. (1) Obtaining dimension estimates for the set of exceptional vantage points for the pinned Falconer distance problem. (2) Nonlinear projection theorems, in the spirit of Kaufman, Bourgain, and Shmerkin.…
We study the algorithmic complexity of embeddings between bi-embeddable equivalence structures. We define the notions of computable bi-embeddable categoricity, (relative) $\Delta^0_\alpha$ bi-embeddable categoricity, and degrees of…
In this paper we construct a new family of sets based on Diophantine approximation in the Euclidean space, and consider their applications in several problems in harmonic analysis. Our first application is on the Hausdorff dimension of our…
We consider the language of $\Delta_0$-formulas with list terms interpreted over hereditarily finite list superstructures. We study the complexity of reasoning in extensions of the language of $\Delta_0$-formulas with non-standard list…
We show that string algebras are `homologically tame' in the following sense: First, the syzygies of arbitrary representations of a finite dimensional string algebra $\Lambda$ are direct sums of cyclic representations, and the left…
We prove that thick category $\mathcal{O}$ associated to a semi-simple complex finite dimensional Lie algebra is extension full in the category of all modules. We also prove the weak Alexandru conjecture both for regular blocks of thick…
A finite-dimensional unital and associative algebra over $\mathbb{R}$, or what we shall call simply "an algebra" in this paper for short, generalities the construction by which we derive the complex numbers by "adjoining an element $i$" to…
Strong Steiner $\omega$-categories are a class of $\omega$-categories that admit algebraic models in the form of chain complexes, whose formalism allows for several explicit computations. The conditions defining strong Steiner…
We consider the complexity (in terms of the arithmetical hierarchy) of the various quantifier levels of the diagram of a computably presented metric structure. As the truth value of a sentence of continuous logic may be any real in $[0,1]$,…
In this paper, the first family of conforming discrete three dimensional Gradgrad-complexes consisting of finite element spaces is constructed. These discrete complexes are exact in the sense that the range of each discrete map is the…
High dimensional data can have a surprising property: pairs of data points may be easily separated from each other, or even from arbitrary subsets, with high probability using just simple linear classifiers. However, this is more of a rule…
Multi-fractal patterns occur widely in nature. In developing new algorithms to determine multi-fractal spectra of experimental data I am lead to the conclusion that generalised dimensions $D_q$ of order $q\leq0$, including the Hausdorff…
A topological space $X$ is strongly $D$ if for any neighbourhood assignment $\{U_x:x\in X\}$, there is a $D\subseteq X$ such that $\{U_x:x\in D\}$ covers $X$ and $D$ is locally finite in the topology generated by $\{U_x:x\in X\}$. We prove…
Inspired by Leivant's work on absolute predicativism, Bellantoni and Cook in 1992 introduced a structurally restricted form of recursion called predicative recursion. Using this recursion scheme on the inductive structures of natural…
We introduce a new type of reduction of inversive difference polynomials that is associated with a partition of the basic set of automorphisms $\sigma$ and uses a generalization of the concept of effective order of a difference polynomial.…
Deep neural network classifiers partition input space into high confidence regions for each class. The geometry of these class manifolds (CMs) is widely studied and intimately related to model performance; for example, the margin depends on…
Leibniz algebras are certain generalization of Lie algebras. In this paper we give the classification of $5-$dimensional complex non-Lie nilpotent Leibniz algebras. We use the canonical forms for the congruence classes of matrices of…