Related papers: Inradius of random lemniscates
The maximal degree of monomials belonging to the unique minimal system of monomial generators of the canonical module $\omega(K[{\mathcal P}])$ of the toric ring $K[{\mathcal P}]$ defined by a lattice polytope ${\mathcal P}$ will be…
We study the characteristic polynomial of random permutation matrices following some measures which are invariant by conjugation, including Ewens' measures which are one-parameter deformations of the uniform distribution on the permutation…
In multicentric holomorphic calculus one represents the function $\varphi$ using a new polynomial variable $w=p(z)$ in such a way that when it is evaluated at the operator $A,$ then $p(A)$ is small in norm. Usually it is assumed that $p$…
In this paper we study the asymptotic behavior of the maximum magnitude of a complex random polynomial with i.i.d. uniformly distributed random roots on the unit circle. More specifically, let $\{n_k\}_{k=1}^{\infty}$ be an infinite…
We study the maximum modulus set, $\mathcal{M}(p)$, of a polynomial $p$. We are interested in constructing $p$ so that $\mathcal{M}(p)$ has certain exceptional features. Jassim and London gave a cubic polynomial $p$ such that…
We consider the question of the largest possible combinatorial diameter among $(d-1)$-dimensional simplicial complexes on $n$ vertices, denoted $H_s(n, d)$. Using a probabilistic construction we give a new lower bound on $H_s(n, d)$ that is…
Given finite configurations $P_1, \dots, P_n \subset \mathbb{R}^d$, let us denote by $\mathbf{m}_{\mathbb{R}^d}(P_1, \dots, P_n)$ the maximum density a set $A \subseteq \mathbb{R}^d$ can have without containing congruent copies of any…
We formulate and discuss a necessary and sufficient condition for polynomials to be dense in a space of continuous functions on the real line, with respect to Bernstein's weighted uniform norm. Equivalently, for a positive finite measure…
We study an algorithm for approximating the multivariate independence polynomial $Z(\mathbf{z})$, with negative and complex arguments, an object that has strong connections to combinatorics and to statistical physics. In particular, the…
We study the characteristic polynomial of Haar distributed random unitary matrices. We show that after a suitable normalization, as one increases the size of the matrix, powers of the absolute value of the characteristic polynomial as well…
For the moduli space of unmarked convex $\mathbb{RP}^2$ structures on the surface $S_{g,m}$ with negative Euler characteristic, we investigate the subsets of the moduli space defined by the notions like boundedness of projective invariants,…
In this paper, we give some counting results on integer polynomials of fixed degree and bounded height whose distinct non-zero roots are multiplicatively dependent. These include sharp lower bounds, upper bounds and asymptotic formulas for…
We study characteristic polynomials of symmetric matrices with entries ${i+j\choose i}$ the binomial coefficients, over finite fields.
Recent works of the authors have demonstrated the usefulness of considering moduli spaces of Artinian reductions of a given ring when studying standard graded rings and their Lefschetz properties. This paper illuminates a key aspect of…
Let F:=(f_1,...,f_n) be a random polynomial system with fixed n-tuple of supports. Our main result is an upper bound on the probability that the condition number of f in a region U is larger than 1/epsilon. The bound depends on an integral…
Solutions to optimization problems involving the numerical radius often belong to a special class: the set of matrices having field of values a disk centered at the origin. After illustrating this phenomenon with some examples, we…
In computer aided geometric design a polynomial is usually represented in Bernstein form. The de Casteljau algorithm is the most well-known algorithm for evaluating a polynomial in this form. Evaluation via the de Casteljau algorithm has…
If $p:\mathbb{C} \to \mathbb{C}$ is a non-constant polynomial, the Gauss--Lucas theorem asserts that its critical points are contained in the convex hull of its roots. We consider the case when $p$ is a random polynomial of degree $n$ with…
A partition polynomial is a refinement of the partition number p(n) whose coefficients count some special partition statistic. Just as partition numbers have useful asymptotics so do partition polynomials. In fact, their asymptotics…
The paper deals with different properties of polynomials in random elements: bounds for characteristics functionals of polynomials, stochastic generalization of the Vinogradov mean value theorem, characterization problem, bounds for…