中文
相关论文

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

200 篇论文

Let $C(G)$ be the poset of cyclic subgroups of a finite group $G$ and let $\mathcal{P}$ be the class of $p$-groups of order $p^n$ ($n\geq 3$). Consider the function $\alpha:\mathcal{P}\longrightarrow (0, 1]$ given by…

群论 · 数学 2020-01-29 Mihai-Silviu Lazorec , Rulin Shen , Marius Tărnăuceanu

We consider a problem posed by Erd\H{o}s, Herzog and Piranian on the maximum product of distances of a point set of order $n$ with a given diameter. We prove that it is sufficient to consider convex polygons and obtain results on the…

组合数学 · 数学 2026-03-10 Stijn Cambie , Arne Decadt , Yanni Dong , Tao Hu , Quanyu Tang

We report four $\Sigma$'s and three $\Lambda$'s, in the 1500 - 1800 MeV region, as two meson - one baryon S-wave $(1/2)^+$ resonances. We solve Faddeev equations in the coupled channel approach. The invariant mass of one of the meson-baryon…

核理论 · 物理学 2008-11-26 A. Martinez Torres , K. P. Khemchandani , E. Oset

We have previously calculated the pion-nucleon $\Sigma_{\pi N}$ term in the chiral mixing approach with $u,d$ flavors only, and found the lower bound $\Sigma_{\pi N} \geq \left(1 + \frac{16}{3} \sin^2 \theta \right){3 \over 2}…

高能物理 - 唯象学 · 物理学 2018-12-11 V. Dmitrasinovic , Hua-Xing Chen , Atsushi Hosaka

We study the diametric problem (i.e., optimal anticodes) in the space of permutations under the Ulam distance. That is, let $S_n$ denote the set of permutations on $n$ symbols, and for each $\sigma, \tau \in S_n$, define their Ulam distance…

组合数学 · 数学 2024-03-05 Pat Devlin , Leo Douhovnikoff

We revisit, qualify, and objectively resolve the seemingly controversial question about what is the number of dimensional fundamental constants in Nature. For this purpose, we only assume that all we can directly measure are space and time…

经典物理 · 物理学 2007-12-04 George E. A. Matsas , Vicente Pleitez , Alberto Saa , Daniel A. T. Vanzella

The isotropy constant of any $d$-dimensional polytope with $n$ vertices is bounded by $C \sqrt{n/d}$ where $C>0$ is a numerical constant.

泛函分析 · 数学 2009-04-20 David Alonso-Gutiérrez , Jesús Bastero , Julio Bernués , Paweł Wolff

An $S_k$-set in a group $\Gamma$ is a set $A\subseteq\Gamma$ such that $\alpha_1\cdots\alpha_k=\beta_1\cdots\beta_k$ with $\alpha_i,\beta_i\in A$ implies $(\alpha_1,\ldots,\alpha_k)=(\beta_1,\ldots,\beta_k)$. An $S_k'$-set is a set such…

组合数学 · 数学 2025-09-10 John Byrne , Michael Tait

A set A is a Sidon set in an additive group G if every element of G can be written at most one way as sum of two elements of A. A particular case of two-dimensional Sidon sets are the sonar sequences, which are two-dimensional…

数论 · 数学 2013-11-08 Diego F. Ruiz , Carlos A. Trujillo , Yadira Caicedo

An s-cap n-flat is given by a set of s points, no three of which are on a common line, in an n-dimensional affine space over the field of three elements. The cap set problem in dimension n is: what is the maximum s such that there is an…

组合数学 · 数学 2022-06-22 Henry Robert Thackeray

Generalising results of Erd\H{o}s-Freud and Lindstr\"om, we prove that the largest Sidon subset of a bounded interval of integers is equidistributed in Bohr neighbourhoods. We establish this by showing that extremal Sidon sets are…

组合数学 · 数学 2021-10-27 Miquel Ortega , Sean Prendiville

We compute for reflection groups of type $A,B,D,F_4,H_3$ and for dihedral groups a statistic counting the maximal cardinality of a set of elements in the group whose generalized inversions yield the full set of inversions and which are…

We attempt to quantify the exact proportion of monic $p$-adic polynomials of degree $n$ which are irreducible. We find an exact answer to this when $n$ is prime and $p \neq n$, and also when $n = 4$ and $p \neq 2$. Our answers are rational…

数论 · 数学 2025-03-19 Isaac Rajagopal

Let $n$ and $k$ be positive integers with $n>k$. Given a permutation $(\pi_1,\ldots,\pi_n)$ of integers $1,\ldots,n$, we consider $k$-consecutive sums of $\pi$, i.e., $s_i:=\sum_{j=0}^{k-1}\pi_{i+j}$ for $i=1,\ldots,n$, where we let…

组合数学 · 数学 2019-05-28 Akihiro Higashitani , Kazuki Kurimoto

We consider stopping criteria that balance algebraic and discretization errors for the conjugate gradient algorithm applied to high-order finite element discretizations of Poisson problems. Firstly, we introduce a new stopping criterion…

数值分析 · 数学 2024-08-06 Yichen Guo , Eric de Sturler , Tim Warburton

This note focuses on the properties of two blocks of elements of the probability mass function (pmf) of the Poisson distribution of order $k\ge2$. The first block is the elements for $n\in[1,k]$ and the second block is the elements for…

概率论 · 数学 2023-10-10 S. R. Mane

In 1978 Erd\H os asked if every sufficiently large set of points in general position in the plane contains the vertices of a convex $k$-gon, with the additional property that no other point of the set lies in its interior. Shortly after,…

计算几何 · 计算机科学 2019-10-21 Luis Barba , Frank Duque , Ruy Fabila-Monroy , Carlos Hidalgo-Toscano

The neutron yield in $^{12}$C(d,n)$^{13}$N and the proton yield in $^{12}C(d,p)^{13}$C have been measured by deuteron beam from 0.6 MeV to 3 MeV which is delivered from a 4-MeV electro static accelerator bombarding on the thick carbon…

In this paper, we analyze the time complexity of finding regular polygons in a set of n points. We combine two different approaches to find regular polygons, depending on their number of edges. Our result depends on the parameter alpha,…

计算几何 · 计算机科学 2009-08-19 Greg Aloupis , Jean Cardinal , Sebastien Collette , John Iacono , Stefan Langerman

We prove that every infinite, discrete abelian group admits a pair of $I_0$ sets whose union is not $I_0$. In particular, this implies that every such group contains a Sidon set that is not $I_{0}$.

经典分析与常微分方程 · 数学 2016-02-16 Kathryn E. Hare , L. Thomas Ramsey