Related papers: Tame and wild degree functions
We give an upper bound in O(d ^((n+1)/2)) for the number of critical points of a normal random polynomial with degree d and at most n variables. Using the large deviation principle for the spectral value of large random matrices we obtain…
We survey results and open problems relating degree conditions with tree containment in graphs, random graphs, digraphs and hypergraphs, and their applications in Ramsey theory.
We prove that every finite dimensional algebra over an algebraically closed field is either derived tame or derived wild. The proof is based on the technique of matrix problems (boxes and reduction algorithm). It implies, in particular,…
Consider a rooted N-ary tree. For every vertex of this tree, we atttach an i.i.d. Bernoulli random variable. A path is called open if all the random variables that are assigned on the path are 1. We consider limiting behaviors for the…
We express multiplicities and degree functions of graded families of $\mathfrak{m}_R$-primary ideals in an excellent normal local ring $(R,\mathfrak{m}_R)$ as limits of intersection products. Moreover, in dimension 2, we show more refined…
This paper studies properties of functions having monotone tails. We extend Theorem 1 of Dhaene et al. (2002a) and show how the tail quantiles of a random variable transformed with a monotone tail function can be expressed as the…
We deal with a random graph model where at each step, a vertex is chosen uniformly at random, and it is either duplicated or its edges are deleted. Duplication has a given probability. We analyse the limit distribution of the degree of a…
A class of rational functions characterized by some wonderful properties is studied. The properties that identify this class include simple algebra (their inverses can be expressed in radicals), simple topology (the total space of the…
The degree polynomial of a multigraph $G$ is given by $\sum _{v \in V(G)} x^{\mbox{deg}(v)}$. We investigate here properties of the roots of such polynomials. In addition to examining the roots for some families of graphs with few and many…
In this work, we delve into the study of the 2-switch-degree of a graph $G$, which is nothing more than the degree of $G$ as a vertex of the realization graph $\mathcal{G}(d)$ associated with the degree sequence $d$ of $G$. We explore the…
We describe some forms with greater Waring rank than previous examples. In $3$ variables we give forms of odd degree with strictly greater rank than the ranks of monomials, the previously highest known rank. This narrows the possible range…
In this paper, we consider the problem of determining when two tensor networks are equivalent under a heterogeneous change of basis. In particular, to a string diagram in a certain monoidal category (which we call tensor diagrams), we…
We consider the problem of sensitivity of threshold risk, defined as the probability of a function of a random variable falling below a specified threshold level $\delta >0.$ We demonstrate that for polynomial and rational functions of that…
We investigate the random dynamics of rational maps on the Riemann sphere and the dynamics of semigroups of rational maps on the Riemann sphere. We show that regarding random complex dynamics of polynomials, in most cases, the chaos of the…
Consider a graph $G$ and a real-valued function $f$ defined on the degree set of $G$. The sum of the outputs $f(d_v)$ over all vertices $v\in V(G)$ of $G$ is usually known as the vertex-degree-function indices and is denoted by $H_f(G)$,…
The behaviour under coarsening functors of simple, entire, or reduced graded rings, of free graded modules over principal graded rings, of superfluous monomorphisms and of homological dimensions of graded modules, as well as adjoints of…
We investigate semiconjugate rational functions, that is rational functions $A,$ $B$ related by the functional equation $A\circ X=X\circ B$, where $X$ is a rational function of degree at least two. We show that if $A$ and $B$ is a pair of…
In this paper we study a class of dynamical systems generated by iterations of multivariate polynomials and estimate the degreegrowth of these iterations. We use these estimates to bound exponential sums along the orbits of these dynamical…
We recall that diagonals of rational functions naturally occur in lattice statistical mechanics and enumerative combinatorics. We find that a seven-parameter rational function of three variables with a numerator equal to one (reciprocal of…
The greedy tree $\mathcal{G}(D)$ and the $\mathcal{M}$-tree $\mathcal{M}(D)$ are known to be extremal among trees with degree sequence $D$ with respect to various graph invariants. This paper provides a general theorem that covers a large…