Related papers: Minimal weight expansions in Pisot bases

Weighted automata over the nonnegative reals form a fundamental model for quantitative languages. We show that, up to scaling, this model collapses to probabilistic automata. Concretely, we prove that every weighted automaton whose…

This article applies the principle of Occam's Razor to non-parametric model building of statistical data, by finding a model with the minimal number of bits, leading to an exceptionally effective regularization method for probability…

Suppose $0 < \alpha \leq n$, $H: \Bbb R^n \to [0,1]$ is a Lebesgue measurable function, and $A_\alpha(H)$ is the infimum of all numbers $C$ for which the inequality $\int_B H(x) dx \leq C R^\alpha$ holds for all balls $B \subset \Bbb R^n$…

A general lower bound is developed for the minimax risk when estimating an arbitrary functional. The bound is based on testing two composite hypotheses and is shown to be effective in estimating the nonsmooth functional…

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 present a complete algorithm for finding an exact minimal polynomial from its approximate value by using an improved parameterized integer relation construction method. Our result is superior to the existence of error controlling on…

The minimal excludant of a partition $\lambda$, $\rm{mex}(\lambda)$, is the smallest positive integer that is not a part of $\lambda$. For a positive integer $n$, $ \sigma\, \rm{mex}(n)$ denotes the sum of the minimal excludants of all…

There exists a set $A$ of positive integers such that the number of representations of a large positive integer $m$ as a sum of two elements of $A$ grows with a lower bound of order $\log m$, but for which there is no subset $D$ of $A$…

The output of an association rule miner is often huge in practice. This is why several concise lossless representations have been proposed, such as the "essential" or "representative" rules. We revisit the algorithm given by Kryszkiewicz…

The Riemann Xi-function Xi(t)=xi(1/2+it) is a particularly interesting member of a broad family of entire functions which can be expanded in terms of symmetrized Pochhammer polynomials depending on a certain scaling parameter beta. An…

Let $U$ be a Morse function on a compact connected $m$-dimensional Riemannian manifold, $m \geq 2,$ satisfying $\min U=0$ and let $\mathcal{U} = \{x \in M \: : U(x) = 0\}$ be the set of global minimizers. Consider the stochastic algorithm…

Subspace identification methods (SIMs) have proven very powerful for estimating linear state-space models. To overcome the deficiencies of classical SIMs, a significant number of algorithms has appeared over the last two decades, where most…

In DOI:10.1017/etds.2022.2 the author proved that for each integer $k$ there is an implicit number $M > 0$ such that if $b_1, \cdots , b_k$ are multiplicatively independent integers greater than $M$, there are infinitely many integers whose…

The Riemann Xi-function Xi(t) belongs to a family of entire functions which can be expanded in a uniformly convergent series of symmetrized Pochhammer polynomials depending on a real scaling parameter beta. It can be shown that the…

Fibonacci gate problems have severed as computation primitives to solve other problems by holographic algorithm and play an important role in the dichotomy of exact counting for Holant and CSP frameworks. We generalize them to weighted…

In this paper we study the classical Schmidt game on two families of sets: one related to frequencies of digits in base-$2$ expansions, and one connected to the set of the badly approximable numbers. Namely, we describe some nontrivial…

We show that for any set $D$ of at least two digits in a given base $b$, there exists a $\delta(D,b)>0$ such that within the set $\mathcal{A}$ of numbers whose digits base $b$ are exclusively from $D$, the number of even integers in…

Let $s$ be the sum-of-digits function in base $2$, which returns the number of $\mathtt 1$s in the base-2 expansion of a nonnegative integer. For a nonnegative integer $t$, define the asymptotic density \[ c_t=\lim_{N\rightarrow \infty}…

We show the existence of ``good'' approximations to a real number $\gamma$ using rationals with denominators formed by digits $0$ and $1$ in base $b$. We derive an elementary estimate and enhance this result by managing exponential sums.

In this paper, we consider two fundamental cut approximation problems on large graphs. We prove new lower bounds for both problems that are optimal up to logarithmic factors. The first problem is to approximate cuts in balanced directed…