Related papers: A Generalization of the B\^{o}cher-Grace Theorem

For a given elliptic curve $E$ over a finite local ring, we denote by $E^{\infty}$ its subgroup at infinity. Every point $P \in E^{\infty}$ can be described solely in terms of its $x$-coordinate $P_x$, which can be therefore used to…

It is shown that the Poincar\'e-Birkhoff fixed point theorem may be proven by extending the geometric approach originally devised by Henri Poincar\'e himself, along with several results from elementary differential topology. Beginning with…

In the spirit of the Genetics of the Regular Figures, by L. Fejes T\'oth, we prove the following theorem: If $2n$ points are selected in the $n$-dimensional Euclidean ball $B^n$ so that the smallest distance between any two of them is as…

Call a Laurent polynomial $W$ `complete' if its Newton polytope is full-dimensional with zero in its interior. We show that if $W$ is any complete Laurent polynomial with coefficients in the positive part of the field $K$ of generalised…

Let $\Omega\subset\mathbb{C}$ be a bounded domain such that there exists an algebraic harmonic function of degree two vanishing on the boundary of $\Omega.$ Then we show that the Khavinson-Shapiro conjecture holds for $\Omega:$ if the…

In this work we obtain positive bounded solutions of various perturbations of \begin{equation} \left\{ \begin{array}{lcl} \hfill -\Delta u - \gamma \sum_{i,j=1}^N \frac{x_i x_j}{|x|^2} u_{x_i x_j} &=& u^p \qquad \mbox{ in } B_1, \\ \hfill u…

A theorem which is named after the American Mathematician Moris Marden states a very surprising and interesting fact concerning the relationship between the points of a triangle in the complex plane and the zeros of two complex polynomials…

Andr\'e's celebrated Theorem of 1998 implies that each complex straight line (apart from obvious exceptions) contains at most finitely many points whose both coordinates are j-invariants of elliptic curves with complex multiplication. We…

A classical fact is that through any $d+3$ general points in $\mathbb{P}_\mathbb{C}^d$ there exists a unique rational normal curve of degree $d$ passing through them. We generalize this by proving the following: when $n$ is odd, for any…

The classical polynomial interpolation problem in several variables can be generalized to the case of points with greater multiplicities. What is known, as yet, is essentially concentrated in the Alexander-Hirschowitz Theorem which says…

Let f1, ..., fs be a polynomial family in Q[X1,..., Xn] (with s less than n) of degree bounded by D. Suppose that f1, ..., fs generates a radical ideal, and defines a smooth algebraic variety V. Consider a projection P. We prove that the…

Generalizing the classical matrix-tree theorem we provide a formula counting subgraphs of a given graph with a fixed 2-core. We use this generalization to obtain an analog of the matrix-tree theorem for the root system $D_n$ (the classical…

Let $A$ be a square complex matrix, $z_1$, ..., $z_{n}\in\mathbb C$ be (possibly repetitive) points of interpolation, $f$ be analytic in a neighborhood of the convex hull of the union of the spectrum of $A$ and the points $z_1$, ...,…

Let f be a degree d polynomial defined over the nonarchimedean field C_p, normalized so f is monic and f(0)=0. We say f is post-critically bounded, or PCB, if all of its critical points have bounded orbit under iteration of f. It is known…

Denote by $G=(V,E)$ a finite graph. We study a generalized Chern-Simons equation $$ \Delta u=\lambda \mathrm{e}^u(\mathrm{e}^{bu}-1)+4\pi\sum\limits_{j=1}^{N}\delta_{p_j} $$ on $G$, where $\lambda$ and $b$ are positive constants; $N$ is a…

We define \emph{generalized standard triples} $\mathbf{X}$, $\mathbf{Y}$, and $L(z) = z\mathbf{C}_{1} - \mathbf{C}_{0}$, where $L(z)$ is a linearization of a regular matrix polynomial $\mathbf{P}(z) \in \mathbb{C}^{n \times n}[z]$, in order…

We show that near any given minimizing sequence of paths for the mountain pass lemma, there exists a critical point whose polarization is also a critical point. This is motivated by the fact that if any polarization of a critical point is…

It is well known that, using fast algorithms for polynomial multiplication and division, evaluation of a polynomial $F \in \mathbb{C}[x]$ of degree $n$ at $n$ complex-valued points can be done with $\tilde{O}(n)$ exact field operations in…

We show that computing even very coarse approximations of critical points is intractable for simple classes of nonconvex functions. More concretely, we prove that if there exists a polynomial-time algorithm that takes as input a polynomial…

We solve the following problem of W.H. Besant using a formula for the coefficients of an ellipse inscribed in a quadrilateral, $Q$: \enquote{If an ellipse be inscribed in a quadrilateral so that one focus is equidistant from the four…