中文
相关论文

相关论文: Perfect difference sets constructed from Sidon set…

200 篇论文

For $x\geq 3$, we define $w(x)$ as the highest integer $w$ for which there exist integers $m, y\geq 1$ and $1\leq n_1<\dots<n_m\leq x$ such that $n_1\cdots n_m=y^w$. We show that \[w(x)=x\exp\big(-(\sqrt{2}+o(1))\sqrt{\log x\log\log…

数论 · 数学 2022-09-27 Élie Goudout

We study the problem of existence of (nontrivial) perfect codes in the discrete $ n $-simplex $ \Delta_{\ell}^n := \left\{ \begin{pmatrix} x_0, \ldots, x_n \end{pmatrix} : x_i \in \mathbb{Z}_{+}, \sum_i x_i = \ell \right\} $ under $ \ell_1…

信息论 · 计算机科学 2020-08-13 Mladen Kovačević , Dejan Vukobratović

We randomly construct various subsets $\Lambda$ of the integers which have both smallness and largeness properties. They are small since they are very close, in various meanings, to Sidon sets: the continuous functions with spectrum in…

泛函分析 · 数学 2009-12-22 Daniel Li , Hervé Queffélec , Luis Rodriguez-Piazza

Let L be the zero set of a nonconstant monic polynomial with complex coefficients. In the context of constructive mathematics without countable choice, it may not be possible to construct an element of L. In this paper we introduce a notion…

逻辑 · 数学 2015-10-06 Robert Lubarsky , Fred Richman

The set splittability problem is the following: given a finite collection of finite sets, does there exits a single set that contains exactly half the elements from each set in the collection? (If a set has odd size, we allow the floor or…

组合数学 · 数学 2019-09-17 Peter Bernstein , Cashous Bortner , Samuel Coskey , Shuni Li , Connor Simpson

A totally symmetric set is a finite subset of a group for which any permutation of the elements can be realized by conjugation in the ambient group. Such sets are rigid under homomorphisms, and so exert a great deal of control over the…

群论 · 数学 2022-04-27 Noah Caplinger , Nick Salter

We show that a set of non-negative reals is the distance set of a separable complete metric space if and only if it is either countable or is an analytic set which has 0 as a limit point. We also consider spaces with simpler distance sets.

逻辑 · 数学 2025-09-03 John D. Clemens

The set of associative and commutative hypercomplex numbers, called the perfect hypercomplex algebra (PHA) is investigated. Necessary and sufficient conditions for an algebra to be a PHA via semi-tensor product(STP) of matrices are…

环与代数 · 数学 2021-05-10 Daizhan Cheng , Zhengping Ji

A finite set X in the d-dimensional Euclidean space is called an s-distance set if the set of Euclidean distances between any two distinct points of X has size s. Larman--Rogers--Seidel proved that if the cardinality of a two-distance set…

度量几何 · 数学 2011-02-01 Hiroshi Nozaki

We develop machinery to explicitly determine, in many instances, when the difference $x^2-y^n$ is divisible only by powers of a given fixed prime. This combines a wide variety of techniques from Diophantine approximation (bounds for linear…

数论 · 数学 2023-09-20 Michael A. Bennett , S. Siksek

We highlight a certain compactness of Sidon sets and $B_2[g]$-sets and provide several applications. Notably, we prove the existence of such sets that maximize certain functions. In particular, we show the existence of a Sidon set whose…

组合数学 · 数学 2026-04-14 Robin Riblet , Titien Schehr

Let $A$ be a subset of a finite field $\mathbb{F}$. When $\mathbb{F}$ has prime order, we show that there is an absolute constant $c > 0$ such that, if $A$ is both sum-free and equal to the set of its multiplicative inverses, then $|A| <…

数论 · 数学 2022-12-08 Katherine Benjamin

Pseudorandom binary sequences with optimal balance and autocorrelation have many applications in stream cipher, communication, coding theory, etc. It is known that binary sequences with three-level autocorrelation should have an almost…

密码学与安全 · 计算机科学 2016-02-22 Minglong Qi , Shengwu Xiong , Jingling Yuan , Wenbi Rao , Luo Zhong

Two sets of nonnegative integers $A=\{a_1<a_2<\cdots\}$ and $B=\{b_1<b_2<\cdots\}$ are defined as \emph{disjoint}, if $\{A-A\}\bigcap\{B-B\}=\{0\}$, namely, the equation $a_i+b_t=a_j+b_k$ has only trivial solution. In 1984, Erd\H os and…

数论 · 数学 2022-08-25 Jin-Hui Fang , Csaba Sándor

In the several contexts such as combinatorial number theory, families of sets of positive integers closed under taking subsets have been investigated. Then it is sometimes useful to give bijections between the set of the one-sided infinite…

组合数学 · 数学 2024-12-31 Shoichi Kamada

For the family of graded lattice ideals of dimension 1, we establish a complete intersection criterion in algebraic and geometric terms. In positive characteristic, it is shown that all ideals of this family are binomial set theoretic…

交换代数 · 数学 2024-02-07 Hiram H. Lopez , Rafael H. Villarreal

For a positive integer $n$, let $g(n)$ denote the infimum of all real numbers $L$ such that there exists a multiplicative Sidon set $A\subseteq\{1,2,\dots,n\}$ that intersects every interval $[x,x+L]\subseteq[1,n]$. S\'ark\"ozy asked for…

数论 · 数学 2026-05-05 Wouter van Doorn , Pietro Monticone , Quanyu Tang

Consider a set of integers $\mathscr A$ having finite diameter $X$, and a system of simultaneous polynomial equations to be solved over $\mathscr A$. In many circumstances, it is known that the number of solutions of this system is…

数论 · 数学 2023-06-01 Trevor D. Wooley

Let $\mathscr{X}$ be the set of positive real sequences $x=(x_n)$ such that the series $\sum_n x_n$ is divergent. For each $x \in \mathscr{X}$, let $\mathcal{I}_x$ be the collection of all $A\subseteq \mathbf{N}$ such that the subseries…

经典分析与常微分方程 · 数学 2020-11-24 Marek Balcerzak , Paolo Leonetti

Quantum states that remain separable (i.e., not entangled) under any global unitary transformation are known as absolutely separable and form a convex set. Despite extensive efforts, the complete characterization of this set remains largely…