English
Related papers

Related papers: Borcea's variance conjectures on the critical poin…

200 papers

Regular polygons are characterized as area-constrained critical points of the perimeter functional with respect to particular families of perturbations in the class of polygons with a fixed number of sides. We also review recent results in…

Analysis of PDEs · Mathematics 2024-06-27 Marco Bonacini , Riccardo Cristoferi , Ihsan Topaloglu

We present new stochastic geometry theorems that give bounds on the probability that $m$ random data classes all contain a point in common in their convex hulls. We apply these stochastic separation theorems to obtain bounds on the…

Probability · Mathematics 2019-07-24 Jesús A. De Loera , Thomas A. Hogan

We formulate a generalization of Vojta's conjecture in terms of log pairs and variants of multiplier ideals. In this generalization, a variety is allowed to have singularities. It turns out that the generalized conjecture for a log pair is…

Number Theory · Mathematics 2016-10-13 Takehiko Yasuda

This paper discusses the split feasibility problem with polynomials. The sets are semi-algebraic, defined by polynomial inequalities. They can be either convex or nonconvex, either feasible or infeasible. We give semidefinite relaxations…

Optimization and Control · Mathematics 2017-08-01 Jiawang Nie , Jinling Zhao

We consider a problem of bounding the maximal possible multiplicity of a zero at of some expansions $\sum a_i F_i(x)$, at a certain point $c,$ depending on the chosen family $\{F_i \}$. The most important example is a polynomial with $c=1.$…

Classical Analysis and ODEs · Mathematics 2016-09-07 Ilia Krasikov

Let $\mathbf{K}$ be a field and $\phi$, $\mathbf{f} = (f_1, \ldots, f_s)$ in $\mathbf{K}[x_1, \dots, x_n]$ be multivariate polynomials (with $s < n$) invariant under the action of $\mathcal{S}_n$, the group of permutations of $\{1, \dots,…

Symbolic Computation · Computer Science 2020-09-03 Jean-Charles Faugère , George Labahn , Mohab Safey El Din , Éric Schost , Thi Xuan Vu

The computation of the topology of a real algebraic plane curve is greatly simplified if there are no more than one critical point in each vertical line: the general position condition. When this condition is not satisfied, then a finite…

Algebraic Geometry · Mathematics 2023-03-07 Jorge Caravantes , Gema M. Diaz-Toca , Laureano Gonzalez-Vega

We show that (as conjectured by Lin and Wang) when a Vassiliev invariant of type $m$ is evaluated on a knot projection having $n$ crossings, the result is bounded by a constant times $n^m$. Thus the well known analogy between Vassiliev…

q-alg · Mathematics 2008-02-03 Dror Bar-Natan

The problems on the location of the matrix spectrum inside or outside domains bounded by ellipses or parabolas are studied. Special Lyapunov-type equations are connected with these problems. Theorems about the unique solvability of such…

Classical Analysis and ODEs · Mathematics 2023-12-20 G. V. Demidenko , Z. Wang

In this paper, we examine how well a rational point P on an algebraic variety X can be approximated by other rational points. We conjecture that if P lies on a rational curve, then the best approximations to P on X can be chosen to lie…

Number Theory · Mathematics 2007-05-23 David McKinnon

Let $(Z_k)_{k\geq 1}$ be a sequence of independent and identically distributed complex random variables with common distribution $\mu$ and let $P_n(X):=\prod_{k=1}^n (X-Z_k)$ the associated random polynomial in $\mathbb C[X]$. In [Kab15],…

Probability · Mathematics 2024-03-06 Jürgen Angst , Dominique Malicet , Guillaume Poly

The complex or non-hermitian orthogonal polynomials with analytic weights are ubiquitous in several areas such as approximation theory, random matrix models, theoretical physics and in numerical analysis, to mention a few. Due to the…

Classical Analysis and ODEs · Mathematics 2016-04-26 A. Martinez-Finkelshtein , E. A. Rakhmanov

We show that the variation of the topology at infinity of a two-variable polynomial function is localisable at a finite number of "atypical points" at infinity. We construct an effective algorithm with low complexity in order to detect…

Algebraic Geometry · Mathematics 2021-07-20 Luis Renato G. Dias , Cezar Joiţa , Mihai Tibăr

A conjecture of Sendov states that if a polynomial has all its roots in the unit disk and if $\beta$ is one of those roots, then within one unit of $\beta$ lies a root of the polynomial's derivative. If we define $r(\beta)$ to be the…

Complex Variables · Mathematics 2007-05-23 Michael Miller

Let $p$ be an odd prime. In the paper we collect the author's various conjectures on congruences modulo $p$ or $p^2$, which are concerned with sums of binomial coefficients, Lucas sequences, power residues and special binary quadratic…

Number Theory · Mathematics 2013-02-07 Zhi-Hong Sun

Je retracerai l'histoire des conjectures de Weil sur le nombre de solutions d'\'equations polynomiales dans un corps fini et quelques unes des approches qui ont \'et\'e propos\'ees pour les r\'esoudre. The Weil conjectures: origins,…

Number Theory · Mathematics 2022-11-28 Antoine Chambert-Loir

We present a new killing-a-fly-with-a-sledgehammer proof of one of the oldest results in probability which says that the probability that a random permutation on $n$ elements has no fixed points tends to $e^{-1}$ as $n$ tends to infinity.…

Number Theory · Mathematics 2019-12-03 Lior Bary-Soroker , Ofir Gorodetsky

We study the convergence of random function iterations for finding an invariant measure of the corresponding Markov operator. We call the problem of finding such an invariant measure the stochastic fixed point problem. This generalizes…

Optimization and Control · Mathematics 2024-04-16 Neal Hermer , D. Russell Luke , Anja Sturm

Many questions in number theory concern the nonvanishing of determinants of square matrices of logarithms (complex or p-adic) of algebraic numbers. We present a new conjecture that states that if such a matrix has vanishing determinant,…

Number Theory · Mathematics 2024-08-16 Samit Dasgupta , Mahesh Kakde

This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associated matrix. Moreover, we present algorithms to compute more precise…

Symbolic Computation · Computer Science 2011-11-10 Jean-Guillaume Dumas
‹ Prev 1 4 5 6 7 8 10 Next ›