中文
相关论文

相关论文: On univoque Pisot numbers

200 篇论文

For a fairly general class of two-dimensional tiling substitutions, we prove that if the length expansion $\beta$ is a Pisot number, then the tilings defined by the substitution must be locally finite. We also give a simple example of a…

动力系统 · 数学 2012-08-27 Natalie Priebe Frank , E. Arthur Robinson,

The Borsuk number of a set S of diameter d >0 in Euclidean n-space is the smallest value of m such that S can be partitioned into m sets of diameters less than d. Our aim is to generalize this notion in the following way: The k-fold Borsuk…

度量几何 · 数学 2013-11-05 M. Hujter , Z. Lángi

Let $n$ and $r$ be two integers such that $0 < r \le n$; we denote by $\gamma(n,r)$ [$\eta(n,r)$] the minimum [maximum] number of the non-negative partial sums of a sum $\sum_{1=1}^n a_i \ge 0$, where $a_1, \cdots, a_n$ are $n$ real numbers…

组合数学 · 数学 2011-02-24 Giampiero Chiaselotti , Giuseppe Marino , Caterina Nardi

In this paper, we show that if $m$ and $n$ are distinct positive integers and $x$ is a nonzero real number with $\Phi_m(x)=\Phi_n(x)$, then $\frac{1}{2}<|x|<2$ except when $\{m,n\}=\{2,6\}$ and $x=2$. We also observe that 2 appears to be…

数论 · 数学 2019-03-06 Carl Pomerance , Simon Rubinstein-Salzedo

The Upper Bound Theorem for convex polytopes implies that the $p$-th Betti number of the \v{C}ech complex of any set of $N$ points in $\mathbb R^d$ and any radius satisfies $\beta_{p} = O(N^{m})$, with $m = \min \{ p+1, \lceil d/2 \rceil…

组合数学 · 数学 2023-10-24 Herbert Edelsbrunner , János Pach

New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…

In this article, we consider $\beta$-ensembles, i.e. collections of particles with random positions on the real line having joint distribution $$\frac{1}{Z_N(\beta)}|\Delta(\lambda)|^\beta e^{- \frac{N\beta}{4}\sum_{i=1}^N\lambda_i^2}d…

概率论 · 数学 2015-06-25 Florent Benaych-Georges , Sandrine Péché

Let $E/\mathbb{Q}$ be an elliptic curve without complex multiplication. A well-known theorem of Serre asserts that the $\ell$-adic Galois representation $\rho_{E,\ell^\infty}$ is surjective for all but finitely many prime numbers $\ell$.…

数论 · 数学 2025-02-06 Tyler Genao , Jacob Mayle , Jeremy Rouse

We derive a mixed integer nonlinear programming formulation for the problem of finding a convex polygon with a given number of vertices that is small (diameter at most one) and has maximum perimeter. The formulation is based on a geometric…

最优化与控制 · 数学 2024-04-03 Bernd Mulansky , Andreas Potschka

For a polynomial $g(x)$ of deg $k \geq 2$ with integer coefficients and positive integer leading coefficient, we prove an upper bound for the least prime $p$ such that $g(p)$ is in non-homogeneous Beatty sequence $\lbrace \lfloor \alpha…

数论 · 数学 2019-12-03 C. G. Karthick Babu

We characterize one-dimensional Euclidean preference profiles with a small number of alternatives and voters. In particular, we show the following. 1. Every preference profile with up to two voters is one-dimensional Euclidean if and only…

计算机科学与博弈论 · 计算机科学 2018-10-17 Jiehua Chen , Sven Grottke

In this paper we generalize Nesterenko's criterion to the case where the small linear forms have an oscillating behaviour (for instance given by the saddle point method). This criterion provides both a lower bound for the dimension of the…

数论 · 数学 2012-01-13 Stéphane Fischler

We prove asymptotic 0-1 Laws satisfied by diagrams of unimodal sequences of positive integers. These diagrams consist of columns of squares in the plane, and the upper boundary is called the shape. For various types, we show that, as the…

数论 · 数学 2020-11-10 Walter Bridges

We prove an upper bound for the least prime in an irrational Beatty sequence. This result may be compared with Linnik's theorem on the least prime in an arithmetic progression.

数论 · 数学 2016-07-26 Jörn Steuding , Marc Technau

Given a set $P$ of $n$ points in the plane, its separability is the minimum number of lines needed to separate all its pairs of points from each other. We show that the minimum number of lines needed to separate $n$ points, picked randomly…

计算几何 · 计算机科学 2017-06-08 Sariel Har-Peled , Mitchell Jones

Let $ p_{i, n}, i=1,..., N(n)=2^{n-1} $ be the lengths of intervals between the neighboring fractions of Brocot sequence $ F_n $. We obtain an asymptotic formula for $\sigma_{\beta}(F_n)=\sum_{i=1}^{N(n)} p_{i, n}^{\beta} $,which improves…

数论 · 数学 2007-12-15 Anna Dushistova

Suppose $\left\{x_1, \dots, x_n\right\} \subset \mathbb{R}^2$ is a set of $n$ points in the plane with diameter $\leq 1$, meaning $|x_i - x_j| \leq 1$ for all $1 \leq i,j \leq n$. We show that the ratio of the number of ``neighbors''…

组合数学 · 数学 2026-05-19 Samuel Korsky

1. There is no existing any quadratic interval $\eta_{n}:=(n^{2},(n+1)^{2}],$ which contains less than 2 prime numbers. The number of prime numbers within $\eta_{n}$ goes averagely linear with n to infinity. 2. The exact law of the number…

综合数学 · 数学 2015-09-02 Hans Walther Ernst Gerhart Schmidt

From the works of Rauzy and Thurston, we know how to construct (multiple) tilings of some Euclidean space using the conjugates of a Pisot unit $\beta$ and the greedy $\beta$-transformation. In this paper, we consider different…

动力系统 · 数学 2012-02-21 Charlene Kalle , Wolfgang Steiner

Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$. A subset $I$ of $V(G)$ is an independent vertex subset if no two vertices in $I$ are adjacent in $G$. We study the number, $\sigma_1(G)$, of all subsets of $v(G)$ that contain…

组合数学 · 数学 2023-09-12 Eric Ould Dadah Andriantiana , Zekhaya B. Shozi