English
Related papers

Related papers: The Sidon constant of sets with three elements

200 papers

We consider finite element approximations to the optimal constant for the Hardy inequality with exponent $p=2$ in bounded domains of dimension $n=1$ or $n \geq 3$. For finite element spaces of piecewise linear and continuous functions on a…

For given positive integers $a_1,a_2,\dots,a_k$ with $\gcd(a_1,a_2,\dots,a_k)=1$, the denumerant $d(n)=d(n;a_1,a_2,\dots,a_k)$ is the number of nonnegative solutions $(x_1,x_2,\dots,x_k)$ of the linear equation $a_1 x_1+a_2 x_2+\dots+a_k…

Number Theory · Mathematics 2023-06-28 Takao Komatsu , Haotian Ying

We estimate strong coupling constant between the negative parity nucleons with $\pi$ meson within the light cone QCD sum rules. A method for eliminating the unwanted contributions coming from the nucleon--nucleon and nucleon--negative…

High Energy Physics - Phenomenology · Physics 2017-04-05 T. M. Aliev , T. Barakat , M. Savcı

We determine the exact value of the $\eta$-constant and the multiwise Davenport constants for finite abelian groups of rank three having the form $G \simeq C_2 \oplus C_{n_2} \oplus C_{n_3}$ with $2 \mid n_2 \mid n_3$. Moreover, we…

Number Theory · Mathematics 2020-03-06 Benjamin Girard , Wolfgang Schmid

A subset $X$ of a groupoid is said to be deficient if $|X \cdot X|\leq |X|$. It is well-known that the probability that a random groupoid has a deficient $t$-element set with $t\geq 3$ is zero. However, as conjectured in [4], we show that…

Group Theory · Mathematics 2024-07-25 Carles Cardó

A subspace of a finite extension field is called a Sidon space if the product of any two of its elements is unique up to a scalar multiplier from the base field. Sidon spaces were recently introduced by Bachoc et al. as a means to…

Information Theory · Computer Science 2017-05-19 Ron M. Roth , Netanel Raviv , Itzhak Tamo

In this article the solution of the special problem of the conditional extremum for the conjugate trigonometric polynomials is given. A possibility to apply this result to the problems of optimal stabilization of quasidynamic chaos in…

Classical Analysis and ODEs · Mathematics 2012-10-03 D. V. Dmitrishin , A. D. Khamitova

A sign pattern is a matrix that has entries from the set $\{+,-,0\}$. An $n\times n$ sign pattern $\mathcal{P}$ is called consistent if every real matrix in its qualitative class has exactly $k$ real eigenvalues and $n-k$ nonreal…

Combinatorics · Mathematics 2026-01-01 Partha Rana , Sriparna Bandopadhyay

We prove that there is an absolute constant $ C$ such that for every $ n \geq 2 $ and $ N\geq 10^n, $ there exists a polytope $ P_{n,N} \subset \mathbb{R}^n $ with at most $ N $ facets that satisfies…

Probability · Mathematics 2020-03-02 Gil Kur

We prove that the Hausdorff dimension of the set $\mathbf{x}\in [0,1)^d$, such that $$ \left|\sum_{n=1}^N \exp\left(2 \pi i\left(x_1n+\ldots+x_d n^d\right)\right) \right|\ge c N^{1/2} $$ holds for infinitely many natural numbers $N$, is at…

Number Theory · Mathematics 2020-12-16 Changhao Chen , Bryce Kerr , Igor Shparlinski

Building on the work of Gabriel Conant, we investigate the enumeration problems of finite distance monoids by applying the decomposition of Archimedean classes and studying their internal arithmetic progressions. Specifically, we first…

Combinatorics · Mathematics 2025-12-09 Yunjie Luo , Jie Sheng

A semigroup is \emph{nilpotent} of degree 3 if it has a zero, every product of 3 elements equals the zero, and some product of 2 elements is non-zero. It is part of the folklore of semigroup theory that almost all finite semigroups are…

Combinatorics · Mathematics 2012-08-23 Andreas Distler , James D. Mitchell

We establish upper bounds for the size of two-distance sets in Euclidean space and spherical two-distance sets. The main recipe for obtaining upper bounds is the spectral method. We construct Seidel matrices to encode the distance relations…

Combinatorics · Mathematics 2025-09-03 Wei-Chun Chen , Wei-Hsuan Yu

The nth row of Pascal's trinomial triangle gives coefficients of (1+x+x^2)^n. Let g(n) denote the number of such coefficients that are odd. We review Moshe's algorithm for evaluating asymptotics of g(n) -- this involves computing the…

Number Theory · Mathematics 2008-02-20 Steven Finch , Pascal Sebah , Zai-Qiao Bai

We study the natural action of $S_n$ on the set of $k$-subsets of the set $\{1,\dots, n\}$ when $1\leq k \leq \frac{n}{2}$. For this action we calculate the maximum size of a minimal base, the height and the maximum length of an irredundant…

Group Theory · Mathematics 2021-09-13 Nick Gill , Bianca Lodá

The system of falling balls is an autonomous Hamiltonian system with a smooth invariant measure and non-zero Lyapunov exponents almost everywhere. For almost three decades new, the question of its ergodicity remains open. We contribute to…

Dynamical Systems · Mathematics 2020-09-14 Michael Hofbauer-Tsiflakos

Let $R$ be a ring generated by $l$ elements with stable range $r$. Assume that the group $EL_d(R)$ has Kazhdan constant $\epsilon_0>0$ for some $d > r $. We prove that there exist $\epsilon(\epsilon_0,l) >0$ and $k \in N$, s.t. for every $n…

Representation Theory · Mathematics 2007-09-19 Uzy Hadad

Let $B_{n}(t)$ be a $n$-th Stern polynomial and let $e(n)=\op{deg}B_{n}(t)$ be its degree. In this note we continue our study started in \cite{Ul} of the arithmetic properties of the sequence of Stern polynomials and the sequence…

Combinatorics · Mathematics 2011-02-28 Maciej Ulas

Let S(n,0) be the set of monic complex polynomials of degree $n\ge 2$ having all their zeros in the closed unit disk and vanishing at 0. For $p\in S(n,0)$ denote by $|p|_{0}$ the distance from the origin to the zero set of $p'$. We…

Complex Variables · Mathematics 2007-05-23 Julius Borcea

We provide two new exact Sidon-Ramsey numbers to the list known so far. We also improve the upper bounds of the next two Sidon-Ramsey numbers. In doing so, we comment on the tendencies we found on the Sidon-Ramsey partitions that were…

Combinatorics · Mathematics 2023-09-18 Manuel A. Espinosa-García , Daniel Pellicer