相关论文: A Note on Cyclic Gradients
We investigate average gradient degree of normal random polynomials of fixed algebraic degree n. In particular, for polynomials of two variables, asymptotics of the average gradient degree for large values of n is determined.
We present a necessary and sufficient condition for existence of a contractible, non-separating and noncontractible separating Hamiltonian cycle in the edge graph of polyhedral maps on surfaces. In particular, we show the existence of…
Connection of flat polynomials with some spectral questions in ergodic theory is discussed. A necessary condition for a sequence of polynomials of the type $\frac{1}{\sqrt{N}} \big(1 +\sum_{j=1}^{N-1} z^{n_j}\big)$ to be flat in almost…
We explore how the asymptotic structure of a random permutation of $[n]$ with $m$ inversions evolves, as $m$ increases, establishing thresholds for the appearance and disappearance of any classical, consecutive or vincular pattern. The…
Cumulants linearize convolution of measures. We use a formula of Good to define noncommutative cumulants in a very general setting.It turns out that the essential property needed is exchangeability of random variables. Roughly speaking the…
We give necessary and sufficient conditions for a sequence to be exactly realizable as the sequence of numbers of periodic points in a dynamical system. Using these conditions, we show that no non-constant polynomial is realizable, and give…
Results of somewhat mysterious nature are known on the location of zeros of certain polynomials associated with statistical mechanics (Lee-Yang circle theorem) and also with graph counting. In an attempt at clarifying the situation we…
Let D denote the (n-1)-dimensional simplex. Let Y be a random 2-dimensional subcomplex of D obtained by starting with the full 1-skeleton of D and then adding each 2-simplex independently with probability p. For a fixed c>0 it is shown that…
We consider a noncommutative scalar field with a covariantly constant noncommutative parameter in a curved space-time background. For a potential as a noncommutative polynomial it is shown that the stability conditions are unaffected by the…
We present a simple method for the construction of polynomials with cyclic Galois groups, hoping to encourage a reader with some background in algebra to make computations of his/her own.
We consider the problem of finding a condition for a univariate polynomial having a given multiplicity structure when the number of distinct roots is given. It is well known that such conditions can be written as conjunctions of several…
Given a separable nonconstant polynomial $f(x)$ with integer coefficients, we consider the set $S$ consisting of the squarefree parts of all the rational values of $f(x)$, and study its behavior modulo primes. Fixing a prime $p$, we…
An irreducible element of a commutative ring is absolutely irreducible if no power of it has more than one (essentially different) factorization into irreducibles. In the case of the ring $\text{Int}(D)=\{f\in K[x]\mid f(D)\subseteq D\}$,…
For a graph $G$ the random $n$-lift of $G$ is obtained by replacing each of its vertices by a set of $n$ vertices, and joining a pair of sets by a random matching whenever the corresponding vertices of $G$ are adjacent. We show that…
This note is an introduction to the properties of stable polynomials in several variables with real or complex coefficients. These polynomials are defined in terms of where the polynomial is non-vanishing. We do not cover well-known topics…
We give a necessary and sufficient condition for the fundamental group of a finite graph of groups with infinite cyclic edge groups to be acylindrically hyperbolic, from which it follows that a finitely generated group splitting over Z…
We prove new lower bounds on the crossing number of a complete graphs assuming that it is drawn in such a way that it contains a Hamiltonian cycle with no crossings.
A graph $X$ is said to be a pattern polynomial graph if its adjacency algebra is a coherent algebra. In this study we will find a necessary and sufficient condition for a graph to be a pattern polynomial graph. Some of the properties of the…
A criterion and sufficient conditions for a vector to be a cyclic vector for a class of self-adjoint operators are obtained.
Given $n \geq 1$, we study the existence of a tree on $n$ vertices whose independence polynomial is symmetric and unimodal as well as the existence of a symmetric and unimodal independence polynomial of degree $n$ of a tree.