Related papers: On common energies and sumsets
We prove a quantitative version of the Polynomial Szemeredi Theorem for difference sets. This result is achieved by first establishing a higher dimensional analogue of a theorem of Sarkozy (the simplest non-trivial case of the Polynomial…
In the paper we prove for every finite algebra A that either it has the polynomially generated powers (PGP) property, or it has the exponentially generated powers (EGP) property. For idempotent algebras we give a simple criteria for the…
We prove a generalization of the digital binomial theorem by constructing a one-parameter subgroup of generalized Sierpinski matrices. In addition, we derive new formulas for the coefficients of Prouhet-Thue-Morse polynomials and describe…
We use capacity theory to analyze Coppersmith's method for finding small solutions of linear two variable polynomial congruences. We show that the method will succeed in a positive proportion of cases and fail in a different positive…
We show how in PT-symmetric 2J-level quantum systems the assumption of an upside-down symmetry (or duality) of their spectra simplifies their classification based on the non-equivalent pairwise mergers of the energy levels.
We obtain a new bound in the uniform version of the Glasner property for matrices with polynomial entries, improving that of K. Bulinski and A. Fish (2021). This improvement is based on a more careful examination of complete rational…
Article presents a short investigation into some properties of the Moser polynomials which appear in various problems from algebraic combinatorics. For instance, these polynomials can be used to solve the Generalized Moser's Problem on…
Given r>=n quasi-homogeneous polynomials in n variables, the existence of a certain duality is shown and explicited in terms of generalized Morley forms. This result, that can be seen as a generalization of [3,corollary 3.6.1.4] (where this…
Pseudopotential theory has greatly driven first-principles calculations in materials, replacing the explicit treatment of the chemically inert core electrons with an effective potential acting only on the valence states. This is inherently…
Let A be a finite subset of a commutative additive group Z. The sumset and difference set of A are defined as the sets of pairwise sums and differences of elements of A, respectively. The well-known inequality $\sigma(A)^{1/2} \leq…
We classify general systems of polynomial equations with a single solution, or, equivalently, collections of lattice polytopes of minimal positive mixed volume. As a byproduct, this classification provides an algorithm to evaluate the…
The article presents mathematical generalization of results which originated as solutions of practical problems, in particular, the modeling of transitional processes in electrical circuits and problems of resource allocation. However, the…
This article aims at finding sufficient conditions for a family of meromorphic functions to be normal by involving partial sharing of sets with differential polynomials. Moreover, corresponding results for normal meromorphic functions are…
Description of a polynomial time reduction of SAT to 2-SAT of polynomial size.
Several combinatorial identities are presented, involving Stirling functions of the second kind with a complex variable. The identities involve also Stirling numbers of the first kind, binomial coefficients and harmonic numbers.
In this paper, Euler gives the general trionomial coefficient as a sum of the binomial coefficients, the general quadrinomial coefficient as a sum of the binomial and trinomial coefficients, the general quintonomial coefficient as a sum of…
In this note, we give an alternate proof of the multinomial theorem using a probabilistic approach. Although the multinomial theorem is basically a combinatorial result, our proof may be simpler for a student familiar with only basic…
It is known a method for converting a system of Boolean polynomial equations to a single Boolean polynomial equation with less variables. In this paper, we show a formula for systems of Boolean polynomial equations which is based on the…
We show that if a finite, large enough subset A of an arbitrary abelian group satisfies the small doubling condition |A + A| < (log |A|)^{1 - epsilon} |A|, then A must contain a three-term arithmetic progression whose terms are not all…
We give a lower bound for the degree of an irreducible factor of a given polynomial. This improves and generalizes the results obtained in [4, On the irreducible factors of a polynomial, Proc. Amer. Math. Soc., 148 (2020] 1429 -- 1437].