Related papers: Forest Polynomials and Pattern Avoidance

Given an ensemble of randomized regression trees, it is possible to restructure them as a collection of multilayered neural networks with particular connection weights. Following this principle, we reformulate the random forest method of…

The probability that two randomly selected phylogenetic trees of the same size are isomorphic is found to be asymptotic to a decreasing exponential modulated by a polynomial factor. The number of symmetrical nodes in a random phylogenetic…

We introduce a family of rings of symmetric functions depending on an infinite sequence of parameters. A distinguished basis of such a ring is comprised by analogues of the Schur functions. The corresponding structure coefficients are…

In this article, we construct explicit examples of pairs of non-isomorphic trees with the same restricted $U$-polynomial for every $k$; by this we mean that the polynomials agree on terms with degree at most $k+1$. The main tool for this…

We have developed a patch implementing multivariate polynomials seen as a multi-base algebra. The patch is to be released into the software Sage and can already be found within the Sage-Combinat distribution. One can use our patch to define…

For a permutation $u\in S_n$, let $N\ast u\in S_{Nn}$ be the permutation with scaled Lehmer code. For given $u,v,w\in S_n$ and integer $N$, the stretched Schubert coefficients are defined as $f_{u,v,w}(N):=c_{N*u,N*v}^{N*w}$. Our main…

Numerous results on self-reciprocal polynomials over finite fields have been studied. In this paper we generalize some of these to a-self reciprocal polynomials defined in [4]. We consider some properties of the divisibility of a-reciprocal…

Optimizing and certifying the positivity of polynomials are fundamental primitives across mathematics and engineering applications, from dynamical systems to operations research. However, solving these problems in practice requires large…

We give a criterion for a collection of polynomials to be a universal Gr\"{o}bner basis for an ideal in terms of the multidegree of the closure of the corresponding affine variety in $(\mathbb{P}^1)^N$. This criterion can be used to give…

In this article, a new approach based on linear algebra is adopted to study a hybrid Sheffer polynomial sequences. The recurrence relations and differential equation for these polynomials are derived by using the properties and…

We study the probability that a random polynomial with integer coefficients is reducible when factored over the rational numbers. Using computer-generated data, we investigate a number of different models, including both monic and non-monic…

We give combinatorial criteria for predicting the transcendental weight of Feynman integrals of certain graphs in $\phi^4$ theory. By studying spanning forest polynomials, we obtain operations on graphs which are weight-preserving, and a…

We introduce a new family of symmetric polynomials $\mathfrak{G}^{(\mathbf{u},\mathbf{v})}_{\lambda}$ arising from exactly solvable lattice models associated with the quantised loop algebra $\mathcal{U}_{q}(\mathfrak{sl}_{2}[z^\pm])$. The…

We introduce a q-analogue of the classical Zeta polynomial of finite partially ordered sets, as a polynomial in one variable x with coefficients depending on the indeterminate q. We prove some properties of this polynomial invariant,…

Let f be a polynomial in two complex variables. We say that f is nearly irreducible if any two nonconstant polynomial factors of f have a common zero. In the paper we give a criterion of nearly irreducibility for a given polynomial f in…

We introduce the notion of semi-characteristic polynomial for a semi-linear map of a finite- dimensional vector space over a field of characteristic p. This polynomial has some properties in common with the classical characteristic…

First, we derive explicit computable expressions of structured backward errors of approximate eigenelements of structured matrix polynomials including symmetric, skew-symmetric, Hermitian, skew-Hermitian, even and odd polynomials. We also…

We describe a congruence property of solvable polynomials over Q, based on the irreducibility of cyclotomic polynomials over number fields that meet certain conditions.

Let $(W,S)$ be a finite Coxeter system with root system $R$ and with set of positive roots $R^+$. For $\alpha\in R$, $v,w\in W$, we denote by $\partial_\alpha$, $\partial_w$ and $\partial_{w/v}$ the divided difference operators and skew…

The Rogers-Szeg\"o polynomials are natural q-analogues of Newton binomials. In general they have no closed expression. We consider some exceptional cases which are products of a factor with a closed formula and another one with nice values…