相关论文: On the Alexander-Hirschowitz Theorem

In 2021, J.~Agler and J.~E. McCarthy proposed a two-step programme toward the celebrated Krzy\.z conjecture. The first step is to prove an entropy conjecture for polynomials whose zeros all lie on the unit circle; the second is to establish…

We generalize the Embedding Theorem of Eisenbud-Harris from classical Brill-Noether theory to the setting of Hurwitz-Brill-Noether theory. More precisely, in classical Brill-Noether theory, the embedding theorem states that a general linear…

A unified theory of orthogonal polynomials of a discrete variable is presented through the eigenvalue problem of hermitian matrices of finite or infinite dimensions. It can be considered as a matrix version of exactly solvable Schr\"odinger…

Based on the concepts of a generalized critical point and the corresponding generalized P.S. condition introduced by Duong Minh Duc[1], we have proved a new $Z_2$ index theorem and get a result on multiplicity of generalized critical…

We prove algorithmic versions of the polynomial Freiman-Ruzsa theorem of Gowers, Green, Manners, and Tao (Annals of Mathematics, 2025) in additive combinatorics. In particular, we give classical and quantum polynomial-time algorithms that,…

We prove the Pierce--Birkhoff conjecture for splines, i.e., continuous piecewise polynomials of degree $d$ in $n$ variables on a hyperplane partition of $\mathbb{R}^n$, can be written as a finite lattice combination of polynomials. We will…

In 1960, W. Sierpinski proved that there are infinitely many positive odd numbers $k$, such that for any positive integer $n$, $k\times2^n+1$ is a composite number. Such numbers are called "Sierpinski numbers". In this study, by using…

The Alexander method is a combinatorial tool used to determine when two elements of the mapping class group are equal. We extend the Alexander method to include the case of infinite-type surfaces. Versions of the Alexander method was proven…

The Erdos-Szekeres theorem states that for any natural k there is a natural number g(k) such that any set of at least g(k) points on a plane in general position contains a set of k points that are the extreme points of a convex polytope. We…

We give an elementary, self-contained proof of the theorem, proven independently in 1958-9 by Crowell and Murasugi, that the genus of an alternating knot equals half the breadth of its Alexander polynomial, and that applying Seifert's…

We consider the classical problem of estimating norms of higher order derivatives of algebraic polynomial via the norms of polynomial itself. The corresponding extremal problem for general polynomials in uniform norm was solved by A. A.…

We give a detailed proof of the homological Arnold conjecture for nondegenerate periodic Hamiltonians on general closed symplectic manifolds $M$ via a direct Piunikhin-Salamon-Schwarz morphism. Our constructions are based on a coherent…

A simple graph more often than not contains adjacent vertices with equal degrees. This in particular holds for all pairs of neighbours in regular graphs, while a lot such pairs can be expected e.g. in many random models. Is there a…

We consider a polynomial $P\in \mathbb{R}[x_{1},\cdots, x_{d}]$ of degree $ \delta $ that depends non-trivially on each of $x_1,...,x_d$ with $d\geq 2$. For any integer $t$ with $2\leq t\leq d$, any natural number $n \in \mathbb{N}$, and…

We address the Cauchy problem for the $k$-generalized Zakharov-Kuznetsov equation ($k$-gZK) posed on $\mathbb{R}^2$ and on $\mathbb{R} \times \mathbb{T}$. By applying established and recently developed linear and bilinear Strichartz-type…

Milnor proved two uniqueness theorems for axiomatic (co)homology: one for pairs of compacta (1960) and another, in particular, for pairs of countable simplicial complexes (1961). We obtain their common generalization: the Eilenberg-Steenrod…

We present a proof of the Harbourne-Hirschowitz conjecture for linear systems with base points of multiplicity seven or less. This proof uses a well-known degeneration of the projective plane, as well as a combinatorial technique that…

The classical straightening theorem as proved by Douady and Hubbard shows that a polynomial-like sequence is hybrid equivalent to a polynomial. We generalize this result to non-autonomous iteration where one considers composition sequences…

Alexander's lemma is a version of Sperner's lemma published by Alexander two years earlier than Sperner's paper. The present paper is devoted to a modern but elementary exposition of lemmas of Alexander and Sperner and their main…

We prove the Goldbach Conjecture using p-adic analysis and algebraic methods, requiring no knowledge of prime gaps or distribution by showing counterexamples exist if and only if certain polynomials have integer solutions. Assuming, for the…