English
Related papers

Related papers: On the factorization of linear combinations of pol…

200 papers

We study self-adjoint matrix polynomial equations in a single variable and prove existence of self-adjoint solutions under some assumptions on the leading form. Our main result is that any self-adjoint matrix polynomial equation of odd…

Rings and Algebras · Mathematics 2016-08-16 Tim Netzer , Andreas Thom

The problem of matrix factorization motivated by diffraction or elasticity is studied. A powerful tool for analyzing its solutions is introduced, namely analytical continuation formulae are derived. Necessary condition for commutative…

Analysis of PDEs · Mathematics 2012-11-20 Andrey V. Shanin , Eugeny M. Doubravsky

The linearization of complex ordinary differential equations is studied by extending Lie's criteria for linearizability to complex functions of complex variables. It is shown that the linearization of complex ordinary differential equations…

Classical Analysis and ODEs · Mathematics 2011-07-25 S. Ali , F. M. Mahomed , Asghar Qadir

We present integral representations of solutions to division problems involving matrices of polynomials in several complex variables. We also find estimates of the polynomial degree of the solutions by means of careful degree estimates of…

Complex Variables · Mathematics 2008-06-16 Elin Götmark

We compute the factorization homology of a polynomial algebra over a compact and closed manifold with trivialized tangent bundle up to weak equivalence in a new way. This calculation is based on the model of a graph complex and an explicit…

Quantum Algebra · Mathematics 2018-05-22 Lennart Döppenschmitt

The bipartition polynomial of a graph is a generalization of many other graph polynomials, including the domination, Ising, matching, independence, cut, and Euler polynomial. We show in this paper that it is also a powerful tool for proving…

Combinatorics · Mathematics 2017-02-14 Seongmin Ok , Peter Tittmann

We consider Tuenter polynomials as linear combinations of descending factorials and show that coefficients of these linear combinations are expressed via a Catalan triangle of numbers. We also describe a triangle of coefficients in terms of…

Combinatorics · Mathematics 2016-06-15 Andrei K. Svinin

In this paper we study the complexity of factorization of polynomials in the free noncommutative ring $\mathbb{F}\langle x_1,x_2,\dots,x_n\rangle$ of polynomials over the field $\mathbb{F}$ and noncommuting variables $x_1,x_2,\ldots,x_n$.…

Computational Complexity · Computer Science 2015-01-06 V. Arvind , Pushkar S Joglekar , Gaurav Rattan

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…

Let L be a linear difference operator with polynomial coefficients. We consider singularities of L that correspond to roots of the trailing (resp. leading) coefficient of L. We prove that one can effectively construct a left multiple with…

Classical Analysis and ODEs · Mathematics 2007-05-23 S. A. Abramov , M. A. Barkatou , M. van Hoeij

We formulate a conjecture concerning spectral factorization of a class of trigonometric polynomials of two variables and prove it for special cases. Our method uses relations between the distribution of values of a polynomial of two…

Number Theory · Mathematics 2012-08-29 Wayne Lawton

Differential systems with a Fuchsian linear part are studied in regions including all the singularities in the complex plane of these equations. Such systems are not necessarily analytically equivalent to their linear part (they are not…

Classical Analysis and ODEs · Mathematics 2008-08-27 Rodica D. Costin

Bilinear systems of equations are defined, motivated and analyzed for solvability. Elementary structure is mentioned and it is shown that all solutions may be obtained as rank one completions of a linear matrix polynomial derived from…

Rings and Algebras · Mathematics 2013-03-21 Charles R. Johnson , Helena Šmigoc , Dian Yang

Two polynomials, $f,g \in \mathbb{Z}[x]$ are evaluationally coprime at x if $\gcd(f(x),g(x))=1$. We give necessary and sufficient conditions for two such linear polynomials to have a positive proportion of evaluated coprime values.

Number Theory · Mathematics 2017-07-12 Randell Heyman

Let $k$ be a finite field, and $L$ be a $q$-linearized polynomial defined over $k$ of $q$-degree $r$ ($L=\sum^r_{i=0}a_iZ^{q^i}$, with $a_i\in k$). This paper provides an algorithm to compute a characteristic polynomial of $L$ over a large…

Number Theory · Mathematics 2025-06-23 Luca Bastioni , Giacomo Micheli , Shujun Zhao

We give two determinantal representations for a bivariate polynomial. They may be used to compute the zeros of a system of two of these polynomials via the eigenvalues of a two-parameter eigenvalue problem. The first determinantal…

Numerical Analysis · Mathematics 2023-09-18 Bor Plestenjak , Michiel E. Hochstenbach

The question about maximal size of independent system of word equations is one of the most striking problems in combinatorics on words. Recently, Aleksi Saarela has introduced a new approach to the problem that is based on linear-algebraic…

Formal Languages and Automata Theory · Computer Science 2019-12-18 Štěpán Holub , Jan Žemlička

In this paper, we introduce the degenerate central factorial polynomials and numbers of the second kind which are degenerate versions of the central factorial polynomials and numbers of the second kind. We derive some properties and…

Number Theory · Mathematics 2019-02-13 Taekyun Kim , Dae san Kim

Given a right factor and a left factor of a Linear Partial Differential Operator (LPDO), under which conditions we can refine these two-factor factorizations into one three-factor factorization? This problem is solved for LPDOs of arbitrary…

Analysis of PDEs · Mathematics 2010-10-13 Ekaterina Shemyakova

In continuation to our recent work on noncommutative polynomial factorization, we consider the factorization problem for matrices of polynomials and show the following results. (1) Given as input a full rank $d\times d$ matrix $M$ whose…

Computational Complexity · Computer Science 2022-04-01 V. Arvind , Pushkar S. Joglekar
‹ Prev 1 4 5 6 7 8 10 Next ›