English
Related papers

Related papers: Local Method for Compositional Inverses of Permuta…

200 papers

In this note we show that pattern matching in permutations is polynomial time reducible to pattern matching in set partitions. In particular, pattern matching in set partitions is NP-Complete.

Combinatorics · Mathematics 2020-09-02 Thomas Grubb

In our previous paper an effective algorithm for inverting polynomial automorphisms was proposed. Also the class of Pascal finite polynomial automorphisms was introduced. Pascal finite polynomial maps constitute a generalization of…

Number Theory · Mathematics 2019-04-11 Elżbieta Adamus , Paweł Bogdan

In this paper we present an explicit formula for the number of permutations with a given number of alternating descents. Moreover, we study the interlacing property of the real parts of the zeros of the generating polynomials of these…

Combinatorics · Mathematics 2015-04-10 Shi-Mei Ma , Yeong-Nan Yeh

A polynomial-time algorithm is produced which, given generators for a group of permutations on a finite set, returns a direct product decomposition of the group into directly indecomposable subgroups. The process uses bilinear maps and…

Group Theory · Mathematics 2013-03-14 James B. Wilson

We provide explicit formulas for integrating multiplicative forms on local Lie groupoids in terms of infinitesimal data. Combined with our previous work [8], which constructs the local Lie groupoid of a Lie algebroid, these formulas produce…

Differential Geometry · Mathematics 2023-01-02 Alejandro Cabrera , Ioan Marcut , Maria Amelia Salazar

New methods for derivation of Bell polynomials of the second kind are presented. The methods are based on an ordinary generating function and its composita. The relation between a composita and a Bell polynomial is demonstrated. Main…

Combinatorics · Mathematics 2011-09-09 Vladimir Kruchinin

We investigate the permutation property of polynomials of the form $x^{r}(x^{s} -a)^{t}$, and give the expressions of their inverses. In particular, explicit expressions of inverses of permutation polynomials $x(x^3 -a)^2$ and $x(x^2 -a)^3$…

Number Theory · Mathematics 2020-12-29 Yanbin Zheng , Yuyin Yu

In this paper, we propose a new algebraic structure of permutation polynomials over $\mathbb{F}_{q^n}$. As an application of this new algebraic structure, we give some classes of new PPs over $\mathbb{F}_{q^n}$ and answer an open problem in…

Number Theory · Mathematics 2024-10-24 Pingzhi Yuan

We prove local and global invertibility of Sobolev solutions of certain differential inclusions which prevent the differential matrix from having negative eigenvalues. Our results are new even for quasiregular mappings in two dimensions.

Classical Analysis and ODEs · Mathematics 2011-07-07 Leonid V. Kovalev , Jani Onninen

In this paper, we propose linear maps over the space of all polynomials $f(x)$ in $\mathbb{F}_q[x]$ that map $0$ to itself, through their evaluation map. Properties of these linear maps throw up interesting connections with permutation…

Number Theory · Mathematics 2019-11-12 Megha M. Kolhekar , Harish K. Pillai

In this short paper, we survey the results on commutative automorphic loops and give a new construction method. Using this method, we present new classes of commutative automorphic loops of exponent 2 with trivial center.

Group Theory · Mathematics 2015-01-16 Gábor P. Nagy

To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excludes solutions with zero components, an irreducible…

Symbolic Computation · Computer Science 2013-10-16 Danko Adrovic , Jan Verschelde

We construct four new classes of permutation trinomials over the cubic extension of a finite field with even characteristic. Additionally, we explicitly provide the compositional inverse of each class of permutation trinomials in polynomial…

Number Theory · Mathematics 2025-05-06 Sartaj Ul Hasan , Ramandeep Kaur , Hridesh Kumar

We consider compositions of natural numbers when there are different types of each natural number. Several recursions as well as some closed formulas for the number of compositions is derived. We also find its relationships with some known…

Combinatorics · Mathematics 2010-12-17 Milan Janjic

We find all spectral type differential equations satisfied by the symmetric generalized ultraspherical polynomials which are orthogonal on the interval [-1,1] with respect to the classical symmetric weight function for the Jacobi…

Classical Analysis and ODEs · Mathematics 2007-05-23 J. Koekoek , R. Koekoek

We study local generalized additive decompositions (GADs) of homogeneous polynomials and their associated point schemes through their local inverse systems. We prove that their construction and algebraic properties are independent of the…

Commutative Algebra · Mathematics 2026-03-11 Oriol Reig Fité , Daniele Taufer

We present new classes of permutation polynomials over finite fields.

Number Theory · Mathematics 2010-06-10 Jose E. Marcos

In this paper, we prove that any collocation matrix of Bessel polynomials at positive points is strictly totally positive, that is, all its minors are positive. Moreover, an accurate method to construct the bidiagonal factorization of these…

Numerical Analysis · Mathematics 2025-01-20 Jorge Delgado , Héctor Orera , Juan Manuel Peña

We look for differential equations satisfied by the generalized Jacobi polynomials which are orthogonal on the interval [-1,1] with respect to a weight function consisting of the classical Jacobi weight function together with point masses…

Classical Analysis and ODEs · Mathematics 2007-05-23 J. Koekoek , R. Koekoek

This article handles in a short manner a few Laplace transform pairs and some extensions to the basic equations are developed. They can be applied to a wide variety of functions in order to find the Laplace transform or its inverse when…

General Mathematics · Mathematics 2014-02-13 Henrik Stenlund