Related papers: Descriptive complexity in Cantor series

We prove a Khintchine type theorem for approximation of elements in the Cantor set, as a subset of the formal Laurent series over $\mathbb{F}_3$, by rational functions of a specific type. Furthermore we construct elements in the Cantor set…

Navarro defined the set ${Irr}(G \mid Q, \delta) \subseteq {Irr}(G)$, where $Q$ is a $p$-subgroup of a $p$-solvable group $G$, and shows that if $\delta$ is the trivial character of $Q$, then ${Irr}(G \mid Q, \delta)$ provides a set of…

For $-\pi\leq\beta_1<\beta_2\leq\pi$ denote by $\Phi_{\beta_1,\beta_2}(Q)$ the number of algebraic numbers on the unit circle with arguments in $[\beta_1,\beta_2]$ of degree $2m$ and with elliptic height at most $Q$. We show that \[…

We examine a quantum group extension of the standard model with the symmetry $SU(3) \times SU(2) \times U(1)\times $ global $SLq(2)$. The quantum fields of this extended model lie in the state space of the $SLq(2)$ algebra. The normal modes…

We introduce a two-parameter deformation of the classical Poisson distribution from the viewpoint of noncommutative probability theory, by defining a $(q,t)$-Poisson type operator (random variable) on the $(q,t)$-Fock space \cite{Bl12} (See…

Every element $u$ of $[0,1]$ can be written in the form $u=x^2y$, where $x,y$ are elements of the Cantor set $C$. In particular, every real number between zero and one is the product of three elements of the Cantor set. On the other hand…

Assuming a mild non-degeneracy condition excluding very low-level Cantor endpoints, and assuming a counting/input hypothesis for the contribution of non-deep orbit indices, we show that for the quadratic field $K=\mathbb{Q}(\alpha)$ there…

The article is devoted to modeling of the nega-$\tilde Q$-representation of real numbers. The representation is a generalization of representation by alternating Cantor series and positive $\tilde Q$-representation is a generalization of…

We recall the definition of the $\epsilon$-distortion complexity of a set defined in \cite{bcc} and the results obtained in this paper for Cantor sets of the interval defined by iterated function systems. We state an analogous definition…

In this work, we study the computational complexity of quantum determinants, a $q$-deformation of matrix permanents: Given a complex number $q$ on the unit circle in the complex plane and an $n\times n$ matrix $X$, the $q$-permanent of $X$…

In this paper we suggest a simple mathematical procedure to derive the classical probability density of quantum systems via Bohr's correspondence principle. Using Fourier expansions for the classical and quantum distributions, we assume…

We construct a class of homogeneous Cantor-Moran measures with all contraction ratios being reciprocal of integers, and prove that they are pointwise absolutely normal. Our approach relies on methods developed by Davenport, Erd{\H{o}}s, and…

A seminal open question of Pisier and Mendel--Naor asks whether every degree-regular graph which satisfies the classical discrete Poincar\'e inequality for scalar functions, also satisfies an analogous inequality for functions taking values…

In this paper, we introduce the notion of $q$-quasiadditivity of arithmetic functions, as well as the related concept of $q$-quasimultiplicativity, which generalises strong $q$-additivity and -multiplicativity, respectively. We show that…

An open set U of the real numbers R is produced such that the expansion (R,+,x,U) of the real field by U defines a Borel isomorph of (R,+,x,N) but does not define N. It follows that (R,+,x,U) defines sets in every level of the projective…

A real number $x$ is absolutely normal if, for every base $b\ge 2$, every two equally long strings of digits appear with equal asymptotic frequency in the base-$b$ expansion of $x$. This paper presents an explicit algorithm that generates…

In 1994, J.Cobb described a Cantor set in $\mathbb{R}^3$ each of whose projections into 2-planes is one-dimensional. A series of works by other authors developing this field followed. We present another very simple series of Cantor sets in…

Statistical query (SQ) algorithms are algorithms that have access to an {\em SQ oracle} for the input distribution $D$ instead of i.i.d.~ samples from $D$. Given a query function $\phi:X \rightarrow [-1,1]$, the oracle returns an estimate…

Choosing an encoding over binary strings for input/output to/by a Turing Machine is usually straightforward and/or inessential for discrete data (like graphs), but delicate -- heavily affecting computability and even more computational…

The goal of this article is to study some basic algebraic and combinatorial properties of "generalized $n$-series" over a commutative ring $R$, which are functions $s: \mathbf{Z}_{\geq 0} \to R$ satisfying a mild condition. A special…