English
Related papers

Related papers: On univoque Pisot numbers

200 papers

Let $\lfloor t\rfloor$ denote the integer part of $t\in\mathbb{R}$ and $\|x\|$ the distance from $x$ to the nearest integer. Suppose that $1/2<\gamma_2<\gamma_1<1$ are two fixed constants. In this paper, it is proved that, whenever $\alpha$…

Number Theory · Mathematics 2026-05-05 Junyi Chu , Jinjiang Li , Min Zhang

A vanishing sum of roots of unity is called minimal if no proper, nonempty sub-sum of it vanishes. This paper classifies all minimal vanishing sums of roots of unity of weight at most 16 by hand, thereby uncovering new phenomena beyond the…

Number Theory · Mathematics 2025-12-18 Louis Christie , Kenneth J. Dykema , Igor Klep

In this paper we prove a new asymptotic lower bound for the minimal number of simplices in simplicial dissections of $n$-dimensional cubes. In particular we show that the number of simplices in dissections of $n$-cubes without additional…

Metric Geometry · Mathematics 2012-12-27 Alexey Glazyrin

For a (non-unit) Pisot number $\beta$, several collections of tiles are associated with $\beta$-numeration. This includes an aperiodic and a periodic one made of Rauzy fractals, a periodic one induced by the natural extension of the…

Number Theory · Mathematics 2013-10-07 Milton Minervino , Wolfgang Steiner

The simple concept of a SIC poses a very deep problem in algebraic number theory, as soon as the dimension of Hilbert space exceeds three. A detailed description of the simplest possible example is given.

Quantum Physics · Physics 2017-04-05 Ingemar Bengtsson

We give an upper bound in O(d ^((n+1)/2)) for the number of critical points of a normal random polynomial with degree d and at most n variables. Using the large deviation principle for the spectral value of large random matrices we obtain…

Numerical Analysis · Mathematics 2010-07-12 Jean-Pierre Dedieu , Gregorio Malajovich

The Piatetski-Shapiro sequences are of the form $\mathcal{N}_{c} := (\lfloor n^{c} \rfloor)_{n=1}^\infty$, where $\lfloor \cdot \rfloor$ is the integer part. It is expected that there are infinitely many primes in a Piatetski-Shapiro…

Number Theory · Mathematics 2025-12-09 Lingyu Guo , Victor Zhenyu guo , Li Lu

Let $1<\beta \leq 2$. It is well-known that the set of points in $% [0,1/(\beta -1)]$ having unique $\beta $-expansion, in other words, those points whose orbits under greedy $\beta $-transformation escape a hole depending on $\beta $, is…

Dynamical Systems · Mathematics 2016-11-22 Jung-Chao Ban , Chih-Hung Chang , Bing Li

Let $\beta\in(1,2)$ and let $H_\beta$ denote Garsia's entropy for the Bernoulli convolution $\mu_\beta$ associated with $\beta$. In the present paper we show that $H_\beta>0.82$ for all $\beta \in (1, 2)$ and improve this bound for certain…

Dynamical Systems · Mathematics 2019-01-03 Kevin G. Hare , Nikita Sidorov

Define a(k,q) to be the smallest positive multiple of k such that the sum of its digits in base q is equal to k. The asymptotic behavior, lower and upper bound estimates of a(k,q) are investigated. A characterization of the minimality…

Number Theory · Mathematics 2015-05-13 H. Fredricksen , E. J. Ionascu , F. Luca , P. Stanica

A set $S$ of natural numbers is multiplicative Sidon if the products of all pairs in $S$ are distinct. Erd\H{o}s in 1938 studied the maximum size of a multiplicative Sidon subset of $\{1,\ldots, n\}$, which was later determined up to the…

Number Theory · Mathematics 2018-08-21 Hong Liu , Péter Pál Pach

Current methods for the classification of number fields with small regulator depend mainly on an upper bound for the discriminant, which can be improved by looking for the best possible upper bound of a specific polynomial function over an…

Number Theory · Mathematics 2024-04-08 Francesco Battistoni , Giuseppe Molteni

An effective search bound is established for the least non-trivial integer zero of an arbitrary integral cubic form in at least 17 variables.

Number Theory · Mathematics 2009-07-31 T. D. Browning , R. Dietmann , P. D. T. A. Elliott

Let $[\, \cdot\,]$ be the floor function and $\|x\|$ denotes the distance from $x$ to the nearest integer. In this paper we show that whenever $\alpha$ is irrational and $\beta$ is real then for any fixed $1<c<12/11$ there exist infinitely…

Number Theory · Mathematics 2025-05-02 S. I. Dimitrov

We give the first nonconstant lower bounds for the approximability of the Independent Set Problem on the Power Law Graphs. These bounds are of the form $n^{\epsilon}$ in the case when the power law exponent satisfies $\beta <1$. In the case…

Data Structures and Algorithms · Computer Science 2015-03-11 Mathias Hauptmann , Marek Karpinski

A well-known result, due to Meyer, states that the set P of Pisot numbers, generating a real algebraic number field K, is uniformly discrete and relatively dense in the set of positive real number. In the present paper, we show that P is…

Number Theory · Mathematics 2024-02-12 Toufik Zaimi

The crossing number of a graph is the minimum number of crossings in a drawing of the graph in the plane. Our main result is that every graph $G$ that does not contain a fixed graph as a minor has crossing number $O(\Delta n)$, where $G$…

Combinatorics · Mathematics 2018-08-01 Vida Dujmović , Ken-ichi Kawarabayashi , Bojan Mohar , David R. Wood

For $\beta > 1$ a real algebraic integer ({\it the base}), the finite alphabets $\mathcal{A} \subset \mathbb{Z}$ which realize the identity $\mathbb{Q}(\beta) = {\rm Per}_{\mathcal{A}}(\beta)$, where ${\rm Per}_{\mathcal{A}}(\beta)$ is the…

Number Theory · Mathematics 2021-09-30 Denys Dutykh , Jean-Louis Verger-Gaugry

The main purpose of this paper is to study the arithmetical properties of values \(\sum_{m=0}^{\infty} \beta^{-w(m)}\), where \(\beta\) is a fixed Pisot or Salem number and \(w(m)\) (\(m=0,1,\ldots\)) are distinct sequences of nonnegative…

Number Theory · Mathematics 2017-08-11 Hajime Kaneko

We study the number of degree $n$ number fields with discriminant bounded by $X$. In this article, we improve an upper bound due to Schmidt on the number of such fields that was previously the best known upper bound for $6 \leq n \leq 94$.