相关论文: A Polynomial Method Approach to Zero-Sum Subsets i…

In this paper, we study the minimal number of elements of maximal order within a zero-sumfree sequence in a finite Abelian p-group. For this purpose, in the general context of finite Abelian groups, we introduce a new number, for which…

In 1990, Alon and Kleitman proposed an argument for the sum-free subset problem: every set of n nonzero elements of a finite Abelian group contains a sum-free subset A of size |A|>\frac{2}{7}n. In this note, we show that the argument…

Using the interplay between topological, combinatorial, and geometric properties of polynomials and analytic results (primarily the covering structure and distortion estimates), we analyze a path-lifting method for finding approximate…

Fix integers a_1,...,a_d satisfying a_1 + ... + a_d = 0. Suppose that f : Z_N -> [0,1], where N is prime. We show that if f is ``smooth enough'' then we can bound from below the sum of f(x_1)...f(x_d) over all solutions (x_1,...,x_d) in Z_N…

A perfect number is a positive integer $N$ such that the sum of all the positive divisors of $N$ equals $2N$, denoted by $\sigma(N) = 2N$. The question of the existence of odd perfect numbers (OPNs) is one of the longest unsolved problems…

Let $\mathbf{X} \subseteq \mathbb{R}^n$ be a closed set, and consider the problem of computing the minimum $f_{\min}$ of a polynomial $f$ on $\mathbf{X}$. Given a measure $\mu$ supported on $\mathbf{X}$, Lasserre (SIAM J. Optim. 21(3),…

In this expository note we show how combinatorial Nullstellensatz by N. Alon naturally appears in solutions of elementary problems. Simple ideas gradually and naturally appear in such solutions, thus bringing a reader to generalizations.…

In [FI09], Friedlander and Iwaniec studied the so-called Hyperbolic Prime Number Theorem, which asks for an infinitude of elements gamma in SL(2,Z) such that the norm squared |gamma|^2 = a^2 + b^2 + c^2 + d^2 = p, a prime. Under the…

Let $P$ be a polygon with $r>0$ reflex vertices and possibly with holes and islands. A subsuming polygon of $P$ is a polygon $P'$ such that $P \subseteq P'$, each connected component $R$ of $P$ is a subset of a distinct connected component…

In this article, we study the Euler's factorial series $F_p(t)=\sum_{n=0}^\infty n!t^n$ in $p$-adic domain under the Generalized Riemann Hypothesis. First, we show that if we consider primes in $k\varphi(m)/(k+1)$ residue classes in the…

We prove a Jensen-disc type theorem for polynomials $p\in\mathbb{R}[z]$ having all their zeros in a sector of the complex plane. This result is then used to prove the existence of a collection of linear operators…

We prove that for sets $A, B, C \subset \mathbb{F}_p$ with $|A|=|B|=|C| \leq \sqrt{p}$ and a fixed $0 \neq d \in \mathbb{F}_p$ holds $$ \max(|AB|, |(A+d)C|) \gg|A|^{1+1/26}. $$ In particular, $$ |A(A+1)| \gg |A|^{1 + 1/26} $$ and $$…

We give a construction of an infinite set of points $A$ in $\mathbb{R}^2$ such that any subset $P\subseteq A$ has a constant density subset $P'$ with no three points collinear and yet $A$ cannot be separated into finitely many subsets such…

Let $\mathcal{N}[k]$ be the multiset containing the $\binom{n-1}{k}$ products of $k$-subsets of $\{1,\ldots, n-1\}$. We show that if $n\geq (2c+3)^2$, then \begin{gather*}\left((-1)^c+\sum_{M\in \mathcal{N}[n-1-c]}M\right)\cdot(c+1)\equiv…

For a field $\mathbb{F}$ and integers $d$ and $k$, a set ${\cal A} \subseteq \mathbb{F}^d$ is called $k$-nearly orthogonal if its members are non-self-orthogonal and every $k+1$ vectors of ${\cal A}$ include an orthogonal pair. We prove…

We utilize the Wilf-Zeilberger (WZ) method to establish congruences related to truncated Ramanujan-type series. By constructing hypergeometric terms $f(k, a, b, \ldots)$ with Gosper-summable differences and selecting appropriate parameters,…

Let $A$ be a set in an abelian group $G$. For integers $h,r \geq 1$ the generalized $h$-fold sumset, denoted by $h^{(r)}A$, is the set of sums of $h$ elements of $A$, where each element appears in the sum at most $r$ times. If…

An unlabeled poset is said to be (2+2)-free if it does not contain an induced subposet that is isomorphic to 2+2, the union of two disjoint 2-element chains. Let $p_n$ denote the number of (2+2)-free posets of size $n$. In a recent paper,…

In this paper, we investigate optimization problems with nonnegative and orthogonal constraints, where any feasible matrix of size $n \times p$ exhibits a sparsity pattern such that each row accommodates at most one nonzero entry. Our…

Consider a system F of n polynomial equations in n unknowns, over an algebraically closed field of arbitrary characteristic. We present a fast method to find a point in every irreducible component of the zero set Z of F. Our techniques…