中文
相关论文

相关论文: On multiplicatively badly approximable numbers

200 篇论文

The Golomb-Welch conjecture states that there are no perfect $e$-error-correcting Lee codes in $\mathbb{Z}^n$ ($PL(n,e)$-codes) whenever $n\geq 3$ and $e\geq 2$. A special case of this conjecture is when $e=2$. In a recent paper of A.…

信息论 · 计算机科学 2018-04-26 Claudio Qureshi

For any real pair i, j geq 0 with i+j=1 let Bad(i, j) denote the set of (i, j)-badly approximable pairs. That is, Bad(i, j) consists of irrational vectors x:=(x_1, x_2) in R^2 for which there exists a positive constant c(x) such that max…

数论 · 数学 2012-06-29 Stephen Harrap

Let \[ \sum_{n=0}^{\infty}A(n)q^{n} := \frac{(q^{2};q^{5})_{\infty}^{5}(q^{3};q^{5})_{\infty}^{5}}{(q;q^{5})_{\infty}^{5}(q^{4};q^{5})_{\infty}^{5}}, \] \[ \sum_{n=0}^{\infty} B(n)q^{n} := \frac{(q;q^{5})_{\infty}^{5}…

数论 · 数学 2025-12-22 Bing He , Xiongze Zhang

For an integer $q\ge 2$, a perfect $q$-hash code $C$ is a block code over $[q]:=\{1,\ldots,q\}$ of length $n$ in which every subset $\{\mathbf{c}_1,\mathbf{c}_2,\dots,\mathbf{c}_q\}$ of $q$ elements is separated, i.e., there exists…

信息论 · 计算机科学 2023-03-03 Chaoping Xing , Chen Yuan

We prove matching direct and inverse theorems for (algebraic) polynomial approximation with doubling weights $w$ having finitely many zeros and singularities (i.e., points where $w$ becomes infinite) on an interval and not too ``rapidly…

经典分析与常微分方程 · 数学 2015-07-20 Kirill A. Kopotun

We show that for real numbers $p,\,q$ with $q<p$, and the related power means $\mathscr{P}_p$, $\mathscr{P}_q$, the inequality $$\frac{\mathscr{P}_p(x)}{\mathscr{P}_q(x)} \le \exp \bigg( \frac{p-q}8 \cdot \bigg(\ln\bigg(\frac{\max x}{\min…

经典分析与常微分方程 · 数学 2019-10-16 Zsolt Páles , Paweł Pasteczka

Dong and Wang in [Theor. Comput. Sci. 771 (2019) 93--98] conjectured that the resulting graph of the $n$-dimensional folded hypercube $FQ_n$ by deleting any perfect matching is isomorphic to the hypercube $Q_n$. In this paper, we show that…

组合数学 · 数学 2019-05-14 Huazhong Lü , Tingzeng Wu

Define $G(x;q)$ to be the variance of primes $p\le x$ in the arithmetic progressions modulo $q$, weighted by $\log p$. Hooley conjectured that as soon as $q$ tends to infinity and $x\ge q$, we have the upper bound $G(x;q) \ll x \log q$. In…

数论 · 数学 2020-08-14 Daniel Fiorilli , Greg Martin

In a previous paper with the same title, we gave an upper bound for the exponent of uniform rational approximation to a quadruple of $\mathbb{Q}$-linearly independent real numbers in geometric progression. Here, we explain why this upper…

数论 · 数学 2025-04-29 Damien Roy

We show for decreasing, positive approximation functions $\psi$ such that $\tau = \lim_{q \to \infty} \frac{\log \psi(q)}{\log q} < \frac{13 + \sqrt{73}}{8}$ and such that $q^2 \psi(q) \to 0$ that the set $\text{Exact}(\psi)$ of numbers…

数论 · 数学 2023-09-13 Robert Fraser , Reuben Wheeler

Let $E$ be an elliptic curve over $\mathbb{Q}.$ Let $a_p$ denote the trace of the Frobenius endomorphism at a rational prime $p$. For a fixed integer $r,$ define the prime-counting function as $\pi_{E,r}(x):=\sum_{p\leq x,p\nmid…

数论 · 数学 2021-08-16 Hourong Qin

We apply the Pade technique to find rational approximations to % \[h^{\pm}(q_1,q_2)=\sum_{k=1}^\infty\frac{\q_1^k}{1\pm \q_2^k}, 0<q_1,q_2<1, q_1\in\mathbb{Q}, q_2=1/p_2, p_2\in\mathbb{N}\setminus\{1\}.\] % A separate section is dedicated…

经典分析与常微分方程 · 数学 2007-05-23 Jonathan Coussement , Christophe Smet

For a natural number $m$, a Lie algebra $L$ over a field $k$ is said to be of breadth type $(0, m)$ if the co-dimension of the centralizer of every non-central element is of dimension $m$. In this article, we classify finite dimensional…

环与代数 · 数学 2024-04-04 Rijubrata Kundu , Tushar Kanta Naik , Anupam Singh

Let $\psi:\mathbb{N}\to\mathbb{R}_{\ge0}$ be an arbitrary function from the positive integers to the non-negative reals. Consider the set $\mathcal{A}$ of real numbers $\alpha$ for which there are infinitely many reduced fractions $a/q$…

数论 · 数学 2020-05-05 Dimitris Koukoulopoulos , James Maynard

Given a power $q$ of a prime number $p$ and "nice" polynomials $f_1,...,f_r\in\bbF_q[T,X]$ with $r=1$ if $p=2$, we establish an asymptotic formula for the number of pairs $(a_1,a_2)\in\bbF_q^2$ such that…

数论 · 数学 2012-03-06 Lior Bary-Soroker , Moshe Jarden

We provide a number of conditions on the rational numbers $u$ and $v$ which ensure that the Laurent series $g_{u,v}(x):=\prod_{t=0}^\infty (1+ux^{-3^t} + vx^{-2\cdot 3^t})$ is badly approximable.

数论 · 数学 2022-11-14 Dmitry Badziahin , Cameron Eggins

We introduce the Clifford entropy, a measure of how close an arbitrary unitary is to a Clifford unitary, which generalizes the stabilizer entropy for states. We show that this quantity vanishes if and only if a unitary is Clifford, is…

量子物理 · 物理学 2025-12-30 Gianluca Cuffaro , Matthew B. Weiss

For a fixed integer a>1, we suggest that the probability of nullity of the p-Fermat quotient q(p,a) is much lower than 1/p for any arbitrary large prime number p. For this we use various heuristics, justified by means of numerical…

数论 · 数学 2021-08-06 Georges Gras

We introduce the theory of local minimal models for Kan simplicial manifolds, which provide the appropriate generalization of minimal Kan simplicial sets to geometric contexts. We use this to obtain the first proof of Lie's third theorem…

环与代数 · 数学 2026-03-16 Christopher L. Rogers , Jesse Wolfson

It is a classical result from Diophantine approximation that the set of badly approximable numbers has Lebesgue measure zero. In this paper we generalise this result to more general sequences of balls. Given a countable set of closed…

数论 · 数学 2014-05-30 Simon Baker