中文
相关论文

相关论文: The Sidon constant of sets with three elements

200 篇论文

A tree with $n$ vertices has at most $95^{n/13}$ minimal dominating sets. The growth constant $\lambda = \sqrt[13]{95} \approx 1.4194908$ is best possible. It is obtained in a semi-automatic way as a kind of "dominant eigenvalue" of a…

离散数学 · 计算机科学 2019-03-13 Günter Rote

Let $k \ge 2$ be an integer. We say a set $A$ of positive integers is an asymptotic basis of order $k$ if every large enough positive integer can be represented as the sum of $k$ terms from $A$. A set of positive integers $A$ is called…

数论 · 数学 2021-03-19 Sándor Z. Kiss , Csaba Sándor

Here is a direct problem for Sidon sets: Given a linear form $\varphi = c_1 x_1 + \cdots + c_h x_h $, construct and describe sets $A$ that are Sidon sets for $\varphi$. This paper considers an inverse problem for Sidon sets: Given a set…

数论 · 数学 2022-12-14 Melvyn B. Nathanson

For $h \ge 2$ and an infinite set of positive integers $A$, let $R_{A,h}(n)$ denote the number of solutions of the equation $a_{1} + a_{2} + \dots{} + a_{h} = n, a_{1} \in A, \dots{} ,a_{h} \in A, a_{1} < a_{2} < \dots{} < a_{h}.$ In this…

数论 · 数学 2020-06-05 Sandor Kiss , Csaba Sandor

We start by studying the Goldberger-Treiman discrepancy (GTd) $\Delta = (2.259\pm 0.591)%$. Then we look at the $\pi N$ $\sigma$ term, with the dimensionless ratio $\sigma_N/2m_N=3.35%$. Finally we return to predicting (via the quark model)…

高能物理 - 唯象学 · 物理学 2007-05-23 Miroslav Nagy , Michael D. Scadron , Gerald E. Hite

For each natural number $d$, we introduce the concept of a $d$-cap in $\mathbb{F}_3^n$. A subset of $\mathbb{F}_3^n$ is called a $d$-cap if, for each $k = 1, 2, \dots, d$, no $k+2$ of the points lie on a $k$-dimensional flat. This…

组合数学 · 数学 2020-10-14 Yixuan Huang , Michael Tait , Robert Won

A Sidon set is a set of the positive integers such that the sums of two pairs is not repeated. I. Ruzsa gave a probabilistic construction of an infinite Sidon set. In this work we present the details of a simplified proof of this…

数论 · 数学 2011-04-01 Juan Pablo Maldonado

We obtain a new lower bound on the largest Sidon subset of an arbitrary finite set of integers. If $H(n)$ denotes the minimum, over all $n$-element subsets of $\mathbb Z$, of the largest Sidon subset they contain, we prove that $H(n)…

组合数学 · 数学 2026-05-06 Alexandre Bailleul , Robin Riblet

We calculate the complete $T$-matrices of pion-nucleon ($\pi N$) scattering to the third order in heavy baryon SU(3) chiral perturbation theory. The baryon mass in the chiral limit $M_0$ and the low-energy constants are determined by…

核理论 · 物理学 2020-04-03 Bo-Lin Huang , Jing Ou-Yang

In this article, we provide a short and elementary proof of the following result: For $n \geq 3$ the middle coefficient of $\Phi_n(x)$ is either zero (when $n$ is a power of $2$) or an odd integer.

数论 · 数学 2019-04-25 Gregory Dresden

The delta set of a numerical semigroup $S$, denoted $\Delta(S)$, is a factorization invariant that measures the complexity of the sets of lengths of elements in $S$. We study the following problem: Which finite sets occur as the delta set…

交换代数 · 数学 2022-01-25 Stefan Colton , Nathan Kaplan

The purpose of this short problem paper is to raise an extremal question on set systems which seems to be natural and appealing. Our question is: which set systems of a given size maximise the number of $(n+1)$-element chains in the power…

组合数学 · 数学 2019-02-20 J. Robert Johnson , Imre Leader , Paul A. Russell

Given $h,g \in \mathbb{N}$, we write a set $X \subset \mathbb{Z}$ to be a $B_{h}^{+}[g]$ set if for any $n \in \mathbb{Z}$, the number of solutions to the additive equation $n = x_1 + \dots + x_h$ with $x_1, \dots, x_h \in X$ is at most…

数论 · 数学 2024-07-03 Yifan Jing , Akshat Mudgal

We show that for any finite set $A$ and an arbitrary $\varepsilon>0$ there is $k=k(\varepsilon)$ such that the higher energy ${\mathsf{E}}_k(A)$ is at most $|A|^{k+\varepsilon}$ unless $A$ has a very specific structure. As an application we…

数论 · 数学 2021-03-30 Ilya D. Shkredov

The Noether number of a representation is the largest degree of an element in a minimal homogeneous generating set for the corresponding ring of invariants. We compute the Noether number for an arbitrary representation of a cyclic group of…

交换代数 · 数学 2007-05-23 P. Fleischmann , M. Sezer , R. J. Shank , C. F. Woodcock

We estimate the number of incidences in a configuration of $m$ lines and $n$ points in dimension 3. The main term is $mn^{1/3}$ if we work over the real or complex numbers but $mn^{2/5}$ over finite fields. Both of these are optimal, aside…

组合数学 · 数学 2014-12-05 János Kollár

Let D denote the (n-1)-dimensional simplex. Let Y be a random 2-dimensional subcomplex of D obtained by starting with the full 1-skeleton of D and then adding each 2-simplex independently with probability p. For a fixed c>0 it is shown that…

组合数学 · 数学 2013-08-20 Roy Meshulam

In this paper, we propose two families of nonconforming finite elements on $n$-rectangle meshes of any dimension to solve the sixth-order elliptic equations. The unisolvent property and the approximation ability of the new finite element…

数值分析 · 数学 2023-03-13 Xianlin Jin , Shuonan Wu

Let $\varphi(x_1,\ldots, x_h) = c_1 x_1 + \cdots + c_h x_h $ be a linear form with coefficients in a field $\mathbf{F}$, and let $V$ be a vector space over $\mathbf{F}$. A nonempty subset $A$ of $V$ is a $\varphi$-Sidon set if, for all…

数论 · 数学 2022-12-14 Melvyn B. Nathanson

A family of $k$-element subsets of an $n$-element set is called 3-wise intersecting if any three members in the family have non-empty intersection. We determine the maximum size of such families exactly or asymptotically. One of our results…

组合数学 · 数学 2023-04-28 Norihide Tokushige