20,270 research outputs found
A note on Diophantine systems involving three symmetric polynomials
Let and be -th elementary symmetric polynomial. In this
note we prove that there are infinitely many triples of integers such
that for each the system of Diophantine equations
\begin{equation*}
\sigma_{i}(\bar{X}_{2n})=a, \quad \sigma_{2n-i}(\bar{X}_{2n})=b, \quad
\sigma_{2n}(\bar{X}_{2n})=c \end{equation*} has infinitely many rational
solutions. This result extend the recent results of Zhang and Cai, and the
author. Moreover, we also consider some Diophantine systems involving sums of
powers. In particular, we prove that for each there are at least
-tuples of integers with the same sum of -th powers for .
Similar result is proved for and .Comment: to appear in J. Number Theor
-partial permutations and the center of the wreath product algebra
We generalize the concept of partial permutations of Ivanov and Kerov and
introduce -partial permutations. This allows us to show that the structure
coefficients of the center of the wreath product algebra are polynomials in with non-negative integer
coefficients. We use a universal algebra which projects
on the center for each We
show that is isomorphic to the algebra of shifted
symmetric functions on many alphabets
Explicit Formulae for -values in Positive Characteristic
We focus on the generating series for the rational special values of
Pellarin's -series in indeterminates, and using
interpolation polynomials we prove a closed form formula relating this
generating series to the Carlitz exponential, the Anderson-Thakur function, and
the Anderson generating functions for the Carlitz module. We draw several
corollaries, including explicit formulae and recursive relations for Pellarin's
-series in the same range of , and divisibility results on the numerators
of the Bernoulli-Carlitz numbers by monic irreducibles of degrees one and two.Comment: Some helpful clarifications in the introduction. Final edit, as
appears online in Math.
Permutation combinatorics of worldsheet moduli space
52 pages, 21 figures52 pages, 21 figures; minor corrections, "On the" dropped from title, matches published version52 pages, 21 figures; minor corrections, "On the" dropped from title, matches published versio
Every sufficiently large even number is the sum of two primes
The binary Goldbach conjecture asserts that every even integer greater than
is the sum of two primes. In this paper, we prove that there exists an
integer such that every even integer can be expressed as
the sum of two primes, where is the th prime number and . To prove this statement, we begin by introducing a type of double
sieve of Eratosthenes as follows. Given a positive even integer , we
sift from all those elements that are congruents to modulo or
congruents to modulo , where is a prime less than .
Therefore, any integer in the interval that remains unsifted is
a prime for which either or is also a prime. Then, we
introduce a new way of formulating a sieve, which we call the sequence of
-tuples of remainders. By means of this tool, we prove that there exists an
integer such that is a lower bound for the sifting
function of this sieve, for every even number that satisfies , where , which implies that can be expressed as the sum of two primes.Comment: 32 pages. The manuscript was edited for proper English language by
one editor at American Journal Experts (Certificate Verification Key:
C0C3-5251-4504-E14D-BE84). However, afterwards some changes have been made in
sections 1, 6, 7 and
- …