相关论文: Solution of the Hurwitz problem for Laurent polyno…

In this paper we consider polynomial representability of functions defined over $Z_{p^n}$, where $p$ is a prime and $n$ is a positive integer. Our aim is to provide an algorithmic characterization that (i) answers the decision problem: to…

We treat the following "polynomial moment problem": for a complex polynomial P(z) and distinct complex numbers a,b such that P(a)=P(b) to describe polynomials q(z)=Q'(z) orthogonal to all degrees of P(z) on the segment [a,b]. We show that…

E. Maillet proved that the set of Liouville numbers is preserved under rational functions with rational coefficients. Based on this result, a problem posed by Kurt Mahler is to investigate whether there exist entire transcendental functions…

We consider the problem of defining and computing real analogs of polynomial Hurwitz numbers, in other words, the problem of counting properly normalized real polynomials with fixed ramification profiles over real branch points. We show…

We study existence, uniqueness and regularity of solutions for ordinary differential equations with infinitely many derivatives such as (linearized versions of) nonlocal field equations of motion appearing in particle physics, nonlocal…

For R(z, w) rational with complex coefficients, of degree at least 2 in w, we show that the number of rational functions f(z) solving the difference equation f(z+1)=R(z, f(z)) is finite and bounded just in terms of the degrees of R in the…

This paper is a continuation of our earlier work "[T. Jin, Y.Y. Li and J. Xiong, On a fractional Nirenberg problem, part I: blow up analysis and compactness of solutions, to appear in J. Eur. Math. Soc.]", where compactness results were…

This paper presents a connection between Galois points and rational functions over a finite field with small value sets. This paper proves that the defining polynomial of any plane curve admitting two Galois points is an irreducible…

In this paper, we study a certain type of Hurwitz numbers which count branched covers over the Riemann sphere admitting several branch points with fixed ramification types, one branch point with a fixed number of preimages, and one branch…

We show that a problem on minimal periods of solutions of Lipschitz functional differential equations is closely related to the unique solvability of the periodic problem for linear functional differential equations. Sharp bounds for…

We study the number $p(n,t)$ of partitions of $n$ with difference $t$ between largest and smallest parts. Our main result is an explicit formula for the generating function $P_t(q) := \sum_{n \ge 1} p(n,t) \, q^n$. Somewhat surprisingly,…

The first aim of this work is to establish a Peano type existence theorem for an initial value problem involving complex fractional derivative and the second is, as a consequence of this theorem, to give a partial answer to the local…

In this paper, we study various classes of partition functions such as those related to the parity of the number of parts, to differences of partition numbers, and to partitions with a repeated smallest part. We establish identities…

Stanley defined a partition function t(n) as the number of partitions $\lambda$ of n such that the number of odd parts of $\lambda$ is congruent to the number of odd parts of the conjugate partition $\lambda'$ modulo 4. We show that t(n)…

We have done a study of the zero-dimensional $\lambda\phi^{4}$ model. Firstly, we exhibit the partition function as a simple exact expression in terms of the Macdonald's function for $Re(\lambda)>0$. Secondly, an analytic continuation of…

An important question arising from the Frobenius Coin Problem is to decide whether or not a given monetary sum S can be obtained from N coin denominations. We develop a new Generating Function G(x), where the coefficient of x^i is equal to…

We consider the problem of finding the set of classical polylogarithmic functions $\text{Li}_n$ with branching locus determined by the solution of $p_1\cdot p_2\cdot \ldots \cdot p_n=0$, where $p_1,\ldots, p_n$ are irreducible polynomials…

For enumerative problems, i.e. computable functions f from N to Z, we define the notion of an effective (or closed) formula. It is an algorithm computing f(n) in the number of steps that is polynomial in the combined size of the input n and…

We prove that the partition function $p(n)$ is log-concave for all $n>25$. We then extend the results to resolve two related conjectures by Chen. The proofs are based on Lehmer's estimates on the remainders of the Hardy--Ramanujan and the…

Given two closed orientable surfaces, the Hurwitz existence problem asks whether there exists a branched cover between them having prescribed global degree and local degrees over the branching points. The Riemann-Hurwitz formula gives a…