Related papers: Rauzy dimension and finite-state dimension
The description complexity of a model is the length of the shortest formula that defines the model. We study the description complexity of unary structures in first-order logic FO, also drawing links to semantic complexity in the form of…
Recent works have shown that tokenisation is NP-complete. However, these works assume tokenisation is applied to inputs with unboundedly large alphabets -- an unrealistic assumption, given that in practice tokenisers operate over fixed-size…
We prove an optimal bound in twelve dimensions for the uncertainty principle of Bourgain, Clozel, and Kahane. Suppose $f \colon \mathbb{R}^{12} \to \mathbb{R}$ is an integrable function that is not identically zero. Normalize its Fourier…
Let $(\Omega, \mu)$, $(\Delta, \nu)$ be measure spaces and $p=1$ or $p=\infty$. Let $(\{f_\alpha\}_{\alpha\in \Omega}, \{\tau_\alpha\}_{\alpha\in \Omega})$ and $(\{g_\beta\}_{\beta\in \Delta}, \{\omega_\beta\}_{\beta\in \Delta})$ be…
Pseudoentropy characterizations provide a quantitatively precise demonstration of the close relationship between computational hardness and computational randomness. We prove a unified pseudoentropy characterization that generalizes and…
The study is made of the problem of multiple interpolation on an infinite nodes set by the sums of absolutely convergent series of exponentials whose exponents are from a given set. For entire function conditions on nodes and exponents are…
We study the variational structure of the biased infinity Laplacian by introducing a notion of the $\beta$\textit{-Exponential Absolute Minimizing Extension} ($\beta$--AM) on arbitrary length space, which absolutely minimizing the…
We study the oracle complexity of producing $(\delta,\epsilon)$-stationary points of Lipschitz functions, in the sense proposed by Zhang et al. [2020]. While there exist dimension-free randomized algorithms for producing such points within…
In this paper, we study the query complexity of Boolean functions in the presence of uncertainty, motivated by parallel computation with an unlimited number of processors where inputs are allowed to be unknown. We allow each query to…
The super-parametric density estimators and its related algorism were suggested by Y. -S. Tsai et al [7]. The number of parameters is unlimited in the super- parametric estimators and it is a general theory in sense of unifying or…
For an analytic function f(z)=z+\sum_{n=2}^\infty a_n z^n satisfying the inequality \sum_{n=2}^\infty n(n-1)|a_n|\leq \beta, sharp bound on $\beta$ is determined so that $f$ is either starlike or convex of order $\alpha$. Several other…
Various lower bounds are established for the entropy of sums, products and their combinations. First, we derive a prime-field analogue of a version of the entropy power inequality established by Tao over torsion-free groups. Next, we prove…
In this paper we prove that the Watanabe-Yoshida conjecture holds up to dimension $7$. Our primary new tool is a function, $\varphi_J\left(R; z^t\right),$ that interpolates between the Hilbert-Kunz multiplicities of a base ring, $R$, and…
In this paper, our main focus is expressing real numbers on the non-integer bases. We denote those bases as $\beta$'s, which is also a real number and $\beta \in (1,2)$. This project has 3 main parts. The study of expansions of real numbers…
We provide a complete picture of the upper quantization dimension in terms of the R\'enyi dimension by proving that the upper quantization dimension $\bar{D}_{r}(\nu)$ of order $r>0$ for an arbitrary compactly supported Borel probability…
The study of non-linearity (linearity) of Boolean function was initiated by Rothaus in 1976. The classical non-linearity of a Boolean function is the minimum Hamming distance of its truth table to that of affine functions. In this note we…
Nowhere dense classes of graphs are classes of sparse graphs with rich structural and algorithmic properties, however, they fail to capture even simple classes of dense graphs. Monadically stable classes, originating from model theory,…
Inspired by regularization techniques in statistics and machine learning, we study complementary composite minimization in the stochastic setting. This problem corresponds to the minimization of the sum of a (weakly) smooth function endowed…
Let $\{X_t\}_{t\geq 0 }$ be a $d$-dimensional supercritical super-Brownian motion started from the origin with branching mechanism $\psi$. Denote by $R_t:=\inf\{r>0:X_s(\{x\in \mathbb{R}^d:|x|\geq r\})=0,~\forall~0\leq s\leq t\}$ the radius…
In this paper, we develop some basic techniques towards the Riemann hypothesis for higher rank non-abelian zeta functions of an integral regular projective curve of genus $g$ over a finite field $\mathbb F_q$. As an application of the…