English
Related papers

Related papers: Key polynomials and minimal pairs

200 papers

We construct new knot polynomials. Let $V$ be the standard solid torus in 3-space and let $pr$ be its standard projection onto an annulus. Let $M$ be the space of all smooth oriented knots in $V$ such that the restriction of $pr$ is an…

Geometric Topology · Mathematics 2007-05-23 Thomas Fiedler

We consider three types of rings of supersymmetric polynomials: polynomial ones $\Lambda_{m,n}$, partially polynomial $\Lambda_{m,n}^{+y}$ and Laurent supersymmetric rings $\Lambda_{m,n}^{\pm}$. For each type of rings we give their…

Representation Theory · Mathematics 2019-08-15 A. N. Sergeev

Let $S=(s_1,s_2,...,s_m,...)$ be a linear recurring sequence with terms in $GF(q^n)$ and $T$ be a linear transformation of $GF(q^n)$ over $GF(q)$. Denote $T(S)=(T(s_1),T(s_2),...,T(s_m),...)$. In this paper, we first present counter…

Information Theory · Computer Science 2009-12-03 Zhi-Han Gao , Fang-Wei Fu

A sum of a large-dimensional random matrix polynomial and a fixed low-rank matrix polynomial is considered. The main assumption is that the resolvent of the random polynomial converges to some deterministic limit. A formula for the limit of…

Probability · Mathematics 2022-05-23 Patryk Pagacz , Michał Wojtylak

Littlewood polynomials are polynomials with each of their coefficients in $\{-1,1\}$. A sequence of Littlewood polynomials that satisfies a remarkable flatness property on the unit circle of the complex plane is given by the Rudin-Shapiro…

Classical Analysis and ODEs · Mathematics 2023-11-09 Tamás Erdélyi

In Part 1 we study the spherical functions on compact symmetric pairs of arbitrary rank under a suitable multiplicity freeness assumption and additional conditions on the branching rules. The spherical functions are taking values in the…

Representation Theory · Mathematics 2017-06-08 Erik Koelink , Maarten van Pruijssen , Pablo Román

For a non-commutative ring R, we consider factorizations of polynomials in R[t] where t is a central variable. A pseudo-root of a polynomial p(t) is an element x in R, for which there exist polynomials q(t) and s(t) such that…

Rings and Algebras · Mathematics 2020-08-28 Vladimir Retakh , Michael Saks

A new $q$-analogue of Appell polynomial sequences and their generalizations are introduced and their main characterizations are proved. As consequences new $q$-analogue of Bernoulli and Euler polynomials and numbers is introduced, their…

Classical Analysis and ODEs · Mathematics 2018-01-29 P. Njionou Sadjang

Let $\mathcal{R}$ be a finite valuation ring of order $q^r$. In this paper, we prove that for any quadratic polynomial $f(x,y,z) \in \mathcal{R}[x,y,z]$ that is of the form $axy+R(x)+S(y)+T(z)$ for some one-variable polynomials $R, S , T$,…

Combinatorics · Mathematics 2020-07-16 Nguyen Van The , Phuc D Tran , Le Quang Ham , Le Anh Vinh

We investigate rank revealing factorizations of $m \times n$ polynomial matrices $P(\lambda)$ into products of three, $P(\lambda) = L(\lambda) E(\lambda) R(\lambda)$, or two, $P(\lambda) = L(\lambda) R(\lambda)$, polynomial matrices. Among…

Numerical Analysis · Mathematics 2024-10-04 Andrii Dmytryshyn , Froilán Dopico , Paul Van Dooren

We extend and prove a conjecture of Bengu\c{s}-Lasnier on the parametrization of valuations on a polynomial ring by certain spaces of diskoids.

Algebraic Geometry · Mathematics 2022-08-30 Enric Nart , Josnei Novacoski

This article continues our study of $P$- and $Q$-key polynomials, which are (non-symmetric) "partial" Schur $P$- and $Q$-functions as well as "shifted" versions of key polynomials. Our main results provide a crystal interpretation of $P$-…

Combinatorics · Mathematics 2026-01-05 Eric Marberg , Travis Scrimshaw

Set-valued tableaux play an important role in combinatorial $K$-theory. Separately, semistandard skyline fillings are a combinatorial model for Demazure atoms and key polynomials. We unify these two concepts by defining a set-valued…

Combinatorics · Mathematics 2016-11-29 Cara Monical

In this paper, we establish coincidence-like results in the case when the values of the correspondences are not convex. In order to do this, we define a new type of correspondences, namely properly quasi-convex-like. Further, we apply the…

Optimization and Control · Mathematics 2016-05-11 Monica Patriche

For every multivariable polynomial $p$, with $p(0)=1$, we construct a determinantal representation $$p=\det (I - K Z),$$ where $Z$ is a diagonal matrix with coordinate variables on the diagonal and $K$ is a complex square matrix. Such a…

Functional Analysis · Mathematics 2012-08-14 Anatolii Grinshpan , Dmitry S. Kaliuzhnyi-Verbovetskyi , Hugo J. Woerdeman

We state a kind of Euclidian division theorem: given a polynomial P(x) and a divisor d of the degree of P, there exist polynomials h(x),Q(x),R(x) such that P(x) = h(Q(x)) +R(x), with deg h=d. Under some conditions h,Q,R are unique, and Q is…

Algebraic Geometry · Mathematics 2009-10-12 Arnaud Bodin

We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics,…

Rings and Algebras · Mathematics 2018-09-19 Gyula Károlyi , Csaba Szabó

In this paper we consider images of (ordinary) noncommutative polynomials on matrix algebras endowed with a graded structure. We give necessary and sufficient conditions to verify that some multilinear polynomial is a central polynomial, or…

Rings and Algebras · Mathematics 2023-07-10 Ivan Gonzales Gargate , Thiago Castilho de Mello

We prove the case t = 2 of a conjecture of Bruns-Conca-Varbaro, describing the minimal relations between the t x t minors of a generic matrix. Interpreting these relations as polynomial functors, and applying transpose duality as in the…

Commutative Algebra · Mathematics 2021-06-04 Hang Huang , Michael Perlman , Claudia Polini , Claudiu Raicu , Alessio Sammartano

We consider the problem of proving termination for triangular weakly non-linear loops (twn-loops) over some ring $\mathcal{S}$ like $\mathbb{Z}$, $\mathbb{Q}$, or $\mathbb{R}$. The guard of such a loop is an arbitrary quantifier-free…

Logic in Computer Science · Computer Science 2024-02-14 Marcel Hark , Florian Frohn , Jürgen Giesl
‹ Prev 1 8 9 10 Next ›