Related papers: An algorithm to classify the asymptotic set associ…
We use a non-linear characterization of orthonormal polynomials due to Saff in order to show that the behavior of orthonormal polynomials is determined only by its leading coefficient and its normalization. Several applications of this…
With a main tool is signed graphs, we give a full description of the characteristic quasi-polynomials of ideals of classical root systems ($ABCD$) with respect to the integer and root lattices. As a result, we obtain a full description of…
We give a combinatorial classification for the class of postcritically fixed Newton maps of polynomials and indicate potential for extensions. As our main tool, we show that for a large class of Newton maps that includes all hyperbolic…
Three-dimensional random tensor models are a natural generalization of the celebrated matrix models. The associated tensor graphs, or 3D maps, can be classified with respect to a particular integer or half-integer, the degree of the…
A new effective method for factorization of a class of nonrational $n\times n$ matrix-functions with \emph{stable partial indices} is proposed. The method is a generalization of the one recently proposed by the authors which was valid for…
The celebrated Kleene fixed point theorem is crucial in the mathematical modelling of recursive specifications in Denotational Semantics. In this paper we discuss whether the hypothesis of the aforementioned result can be weakened. An…
We consider a generic family of polynomial maps $f:=(f_1,f_2):\mathbb{C}^2\rightarrow\mathbb{C}^2$ with given supports of polynomials, and degree $ d(f):=\max (deg f_1, deg f_2)$. We show that the (non-) properness of maps $f$ in this…
By recognizing them as fundamental groups of developable complexes of groups we prove that mapping class groups of compact orientable surfaces have finite asymptotic dimension.
An improved characteristic set algorithm for solving Boolean polynomial systems is proposed. This algorithm is based on the idea of converting all the polynomials into monic ones by zero decomposition, and using additions to obtain…
We study a family of polynomials which are orthogonal with respect to the varying, highly oscillatory complex weight function $e^{ni\lambda z}$ on $[-1,1]$, where $\lambda$ is a positive parameter. This family of polynomials has appeared in…
We prove a version of Tao's algebraic regularity lemma for asymptotic classes in the context of graphons. We apply it to study expander difference polynomials over fields with powers of Frobenius.
For the class of polynomial skew products of C^2, we describe a rigorous computer algorithm which, for a given map F, will (1) build a model of the dynamics of F on its chain recurrent set, and (2) attempt to determine whether F is Axiom A.…
In this note, we give a detailed proof of an asymptotic for averages of coefficients of a class of degree three $L$-functions which can be factorized as a product of a degree one and a degree two $L$-functions. We emphasize that we can…
We carry out the asymptotic analysis as $n \to \infty$ of a class of orthogonal polynomials $p_{n}(z)$ of degree $n$, defined with respect to the planar measure \begin{equation*} d\mu(z) = (1-|z|^{2})^{\alpha-1}|z-x|^{\gamma}\mathbf{1}_{|z|…
A mixed dominating set is a collection of vertices and edges that dominates all vertices and edges of a graph. We study the complexity of exact and parameterized algorithms for \textsc{Mixed Dominating Set}, resolving some open questions.…
Let $\mathbb{F}_q[t]$ denote the ring of polynomials over $\mathbb{F}_q$, the finite field of $q$ elements. Suppose the characteristic of $\mathbb{F}_q$ is not $2$ or $3$. In this paper, we prove an $\mathbb{F}_q[t]$-analogue of results…
A total dominating set in a graph is a set of vertices such that every vertex of the graph has a neighbor in the set. We introduce and study graphs that admit non-negative real weights associated to their vertices such that a set of…
An upper dominating set in a graph is a minimal (with respect to set inclusion) dominating set of maximum cardinality. The problem of finding an upper dominating set is generally NP-hard. We study the complexity of this problem in classes…
A graph is said to be well-dominated if all its minimal dominating sets are of the same size. The class of well-dominated graphs forms a subclass of the well studied class of well-covered graphs. While the recognition problem for the class…
Let G be a simple graph of order n. The domination polynomial of a graph is the generating function of its dominating sets. We study the domination polynomials of generalized friendship graphs. We also consider book graphs formed by joining…