中文
相关论文

相关论文: On univoque Pisot numbers

200 篇论文

We study poset limits given by sequences of finite interval orders or, as a special case, finite semiorders. In the interval order case, we show that every such limit can be represented by a probability measure on the space of closed…

组合数学 · 数学 2011-04-08 Svante Janson

Erd\H{o}s conjectured in 1946 that every n-point set P in convex position in the plane contains a point that determines at least floor(n/2) distinct distances to the other points of P. The best known lower bound due to Dumitrescu (2006) is…

计算几何 · 计算机科学 2013-03-25 Gabriel Nivasch , János Pach , Rom Pinchasi , Shira Zerbib

A conjecture of Sendov states that if a polynomial has all its roots in the unit disk and if $\beta$ is one of those roots, then within one unit of $\beta$ lies a root of the polynomial's derivative. If we define $r(\beta)$ to be the…

复变函数 · 数学 2007-05-23 Michael Miller

We present a construction of 1-perfect binary codes, which gives a new lower bound on the number of such codes. We conjecture that this lower bound is asymptotically tight.

组合数学 · 数学 2009-09-25 Denis Krotov , Sergey Avgustinovich

We give some necessary and sufficient conditions for the possibility to represent a Hermitian operator on an infinite-dimensional Hilbert space (real or complex) in the form $\sum_{i=1}^nQ_iP_i$, where $P_1,\dots,P_n$, $Q_1,\dots,Q_n$ are…

泛函分析 · 数学 2014-06-16 Andrzej Komisarski , Adam Paszkiewicz

We establish a lower bound for the size of possible counterexamples of the Dixmier Conjecture. We prove that $B>15$, where $B$ is the minimum of the greatest common divisor of the total degrees of $P$ and $Q$, where $(P,Q)$ runs over the…

环与代数 · 数学 2013-10-31 Jorge A. Guccione , Juan J. Guccione , Christian Valqui

Let K be a real algebraic number field and let P be the set of Pisot numbers generating K. We show that the elements of P-P are the algebraic integers of K whose images under the action of all embeddings of K into C, other than the identity…

数论 · 数学 2025-03-28 M. J. Bertin , T. Zaïmi

A family of subsets of $\{1,2,\ldots,n\}$ is said to be {\em antipodal} if it is closed under taking complements. We prove a best-possible isoperimetric inequality for antipodal families of subsets of $\{1,2,\ldots,n\}$. Our inequality…

组合数学 · 数学 2017-11-15 David Ellis , Imre Leader

Let $\alpha, \beta \geq 0$ and $\alpha + \beta < 1$. In this short note, we show that $\liminf_{n \to \infty} p_n^\beta(p_{n+1}^\alpha - p_n^\alpha) = 0$, where $p_n$ is the $n$th prime. This notes an improvement over results of S\'{a}ndor…

数论 · 数学 2017-09-25 David Lowry-Duda

We present two short proofs giving the best known asymptotic lower bound for the maximum element in a set of $n$ positive integers with distinct subset sums.

组合数学 · 数学 2020-07-21 Quentin Dubroff , Jacob Fox , Max Wenqiang Xu

A conjecture of Sendov states that if a polynomial has all its roots in the unit disk and if $\beta$ is one of those roots, then within one unit of $\beta$ lies a root of the polynomial's derivative. If we define $r(\beta)$ to be the…

复变函数 · 数学 2025-09-09 Michael J. Miller

A Keith number is a positive integer N with the decimal representation a_1a_2...a_n such that n>=2 and N appears in the sequence (K_m) given by the recurrence K_1=a_1,...,K_n=a_n and K_m=K_{m-1}+K_{m-2}+...+K_{m-n} for m>n. We prove that…

数论 · 数学 2007-05-23 Martin Klazar , Florian Luca

Typically, one expects that there are around x\prod_{p\not\in P, p <= x} (1-1/p) integers up to x, all of whose prime factors come from the set P. Of course for some choices of P one may get rather more integers, and for some choices of P…

数论 · 数学 2015-06-26 Andrew Granville , Kannan Soundararajan

The collision problem is to decide whether a function X:{1,..,n}->{1,..,n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of Theta(n^{1/5}) on the number of queries needed by a quantum computer to…

量子物理 · 物理学 2007-05-23 Scott Aaronson

We investigate the relationship between the set S of Pisot numbers and the set T of Salem numbers. Salem first established that: " every Pisot number is an accumulation point of the set T ". Building on Boyd's method, we show that every…

数论 · 数学 2025-09-29 Mohamed Amara

The notion of noncrossing partitions of a partially ordered set (poset) is introduced here. When the poset in question is $[n]=\{1,2,\dots, n\}$ with the complete order of natural numbers, conventional noncrossing partitions arise. The…

组合数学 · 数学 2024-09-09 Ricky X. F. Chen

We find sharp upper and lower bounds for the degree of an algebraic number in terms of the $Q$-dimension of the space spanned by its conjugates. For all but seven nonnegative integers $n$ the largest degree of an algebraic number whose…

数论 · 数学 2007-05-23 Neil Berry , Arturas Dubickas , Noam D. Elkies , Bjorn Poonen , Chris Smyth

We bound the maximal number N of singular points of a plane algebraic curve C that has precisely one place at infinity with one branch in terms of its first Betti number $b_1(C)$. Asymptotically we prove that $N<\sim{17/11}b_1(C)$ for large…

代数几何 · 数学 2009-09-01 Maciej Borodzik

Let $P$ be a finite set of points in the plane in general position, that is, no three points of $P$ are on a common line. We say that a set $H$ of five points from $P$ is a $5$-hole in $P$ if $H$ is the vertex set of a convex $5$-gon…

A graph $G=(V,E)$ is called 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. In this paper, we study bipartite $1$-planar graphs with prescribed numbers of vertices in partite sets. Bipartite…

组合数学 · 数学 2015-03-05 Július Czap , Jakub Przybyło , Erika Škrabuľáková