Related papers: The heat flow conjecture for polynomials and rando…
We study the roots of a random polynomial over the field of $p$-adic numbers. For a random monic polynomial with i.i.d. coefficients in $\mathbb{Z}_p$, we obtain an estimate for the expected number of roots of this polynomial. In…
It has been shown in a recent work by Yakir-Zeitouni that the minimum modulus of random trigonometric polynomials with Gaussian coefficients has a limiting exponential distribution. We show this is a universal phenomenon. Our approach…
The evolution of a small-amplitude localized vortex disturbance in an unbounded shear flow with the linear velocity profile is investigated. Based on the exact solution of the initial problem for basic flow, a revision is made of the…
This note corrects a mistake in the original book in the evolution equations of total curvature for the curve-shrinking flow in an ambient Ricci Flow. The resulting upper bound for the evolution of total curvature is an exponential bound in…
We consider the general branching random walk under minimal assumptions, which in particular guarantee that the empirical particle distribution admits an almost sure central limit theorem. For such a process, we study the large time decay…
Driven by growing momentum in two-dimensional geophysical flow modeling, this paper introduces a general family of "thermal" rotating shallow-water models. The models are capable of accommodating thermodynamic processes, such as those…
Dallard, Milani\v{c}, and \v{S}torgel conjectured that for a hereditary graph class $\mathcal{G}$, if there is some function $f:\mathbb{N}\to\mathbb{N}$ such that every graph $G\in \mathcal{G}$ with clique number $\omega(G)$ has treewidth…
Let $R$ be a commutative Noetherian ring, $I$ an ideal, $M$ and $N$ finitely generated $R$-modules. Assume $V(I)\cap Supp(M)\cap Supp(N)$ consists of finitely many maximal ideals and let ${\l}(\e^i(N/I^nN,M))$ denote the length of…
To directed graphs with unique sink and source we associate a noncommutative associative alsgebra and a polynomial over this algebra. Edges of the graph correspond to pseudo-roots of the polynomial. We give a sufficient condition when…
The existence of global weak solutions to a parabolic energy-transport system in a bounded domain with no-flux boundary conditions is proved. The model can be derived in the diffusion limit from a kinetic equation with a linear collision…
We investigate heat propagation in rigidly rotating bodies within the theory of general relativity. Using a first-order gradient expansion, we derive a universal partial differential equation governing the temperature evolution. This…
This paper seeks to further explore the distribution of the real roots of random polynomials with non-centered coefficients. We focus on polynomials where the typical values of the coefficients have power growth and count the average number…
We consider a curve with boundary points free to move on a line in $\mathbb R^2$, which evolves by the $L^2$--gradient flow of the elastic energy, that is a linear combination of the Willmore and the length functional. For such planar…
In this paper we study a version of (non-Markovian) first passage percolation on graphs, where the transmission time between two connected vertices is non-iid, but increases by a penalty factor polynomial in their expected degrees. Based on…
Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…
We present a simplified explanation of why free fractional convolution corresponds to the differentiation of polynomials, by finding how the finite free cumulants of a polynomial behave under differentiation. This approach allows us to…
By introducing the notions of living and dead nodes a new model of random tree evolution with continuous time parameter has been constructed. It is assumed that two random variables, the lifetime and the offspring number of living nodes…
Newton's method for polynomial root finding is one of mathematics' most well-known algorithms. The method also has its shortcomings: it is undefined at critical points, it could exhibit chaotic behavior and is only guaranteed to converge…
We define a natural extension of pluriclosed flow aiming at constructing solutions of the Hull-Strominger system. We give several geometric formulations of this flow, which yield a series of a priori estimates for the flow and also for the…
It has been shown by Ibragimov and Zaporozhets [In Prokhorov and Contemporary Probability Theory (2013) Springer] that the complex roots of a random polynomial $G_n(z)=\sum_{k=0}^n\xi_kz^k$ with i.i.d. coefficients $\xi_0,\ldots,\xi_n$…