中文
相关论文

相关论文: Rational polynomials of simple type

200 篇论文

Binomial ideals are special polynomial ideals with many algorithmically and theoretically nice properties. We discuss the problem of deciding if a given polynomial ideal is binomial. While the methods are general, our main motivation and…

组合数学 · 数学 2015-09-11 Carsten Conradi , Thomas Kahle

Polynomials in this paper are defined starting from a compact semisimple Lie group. A known classification of maximal, semisimple subgroups of simple Lie groups is used to select the cases to be considered here. A general method is…

In this article we go deeply into the formulation and meaning of the monomiality principle and employ it to study the properties of a set of polynomials, which, asymptotically, reduce to the ordinary two variable Kampe de Feriet family. We…

经典分析与常微分方程 · 数学 2022-05-25 Giuseppe Dattoli , Silvia Licciardi

A result of I.V.Dolgachev states that the complex homaloidal polynomials in three variables, i.e. the complex homogeneous polynomials whose polar map is birational, are of degree at most three. In this note we describe homaloidal…

代数几何 · 数学 2021-05-31 Remi Bignalet-Cazalet

We characterize characteristic polynomials of elements in a central simple algebra. We also give an account for the theory of rational canonical forms for separable linear transformations over a central division algebra, and a description…

数论 · 数学 2012-04-24 Chia-Fu Yu

We investigate the structure of ideals generated by binomials (polynomials with at most two terms) and the schemes and varieties associated to them. The class of binomial ideals contains many classical examples from algebraic geometry, and…

alg-geom · 数学 2008-02-03 David Eisenbud , Bernd Sturmfels

We consider three forms of composition of matroids, each of which extends the category of bimatroids to a rigid monoidal category. Many well-known constructions are functorial or defined by morphisms in these categories. Motivating examples…

组合数学 · 数学 2024-03-07 Kevin Purbhoo

Recursive algebraic construction of two infinite families of polynomials in $n$ variables is proposed as a uniform method applicable to every semisimple Lie group of rank $n$. Its result recognizes Chebyshev polynomials of the first and…

数学物理 · 物理学 2014-11-03 Maryna Nesterenko , Jiri Patera , Agnieszka Tereszkiewicz

Algebraic varieties which are locally isomorphic to open subsets of affine space will be called {\em plain}. Plain varieties are smooth and rational. The converse is true for curves and surfaces, and unknown in general. It is shown that…

代数几何 · 数学 2014-02-26 Gábor Bodnár , Herwig Hauser , Josef Schicho , Orlando Villamayor

Polynomials related to rational solutions of Painleve' equations satisfy certain difference equations. Conditions are given to acertain that all solutions really are polynomials.

经典分析与常微分方程 · 数学 2016-09-07 Gert Almkvist

A non-zero constant Jacobian polynomial maps $F=(P,Q)$ of $\mathbb{C}^2$ is invertible if $P$ and $Q$ are rational polynomials.

代数几何 · 数学 2017-09-13 Nguyen Van Chau

We classify Frobenius forms, a special class of homogeneous polynomials in characteristic $p>0$, in up to five variables over an algebraically closed field. We also point out some of the similarities with quadratic forms.

We construct an effective algorithmic method to compute the homological monodromy of a complex polynomial which is tame. As an application we show the existence of conjugated polynomials in a number field which are not topologically…

代数几何 · 数学 2007-05-23 M. Escario

We classify the discriminantly separable polynomials of degree two in each of three variables, defined by a property that all the discriminants as polynomials of two variables are factorized as products of two polynomials of one variable…

动力系统 · 数学 2014-10-02 Vladimir Dragovic , Katarina Kukic

Polynomial functors are a categorical generalization of the usual notion of polynomial, which has found many applications in higher categories and type theory: those are generated by polynomials consisting a set of monomials built from sets…

计算机科学中的逻辑 · 计算机科学 2021-12-30 Eric Finster , Samuel Mimram , Maxime Lucas , Thomas Seiller

We compute new polynomials with Galois group $M_{11}$ over $\mathbb{Q}(t)$. These polynomials stem from various families of covers of $\mathbb{P}^1\mathbb{C}$ ramified over at least 4 points. Each of these families has features that make a…

数论 · 数学 2016-12-20 Joachim König

Say a trinomial $x^n+A x^m+B \in \Q[x]$ has reducibility type $(n_1,n_2,...,n_k)$ if there exists a factorization of the trinomial into irreducible polynomials in $\Q[x]$ of degrees $n_1$, $n_2$,...,$n_k$, ordered so that $n_1 \leq n_2 \leq…

数论 · 数学 2011-12-20 Andrew Bremner , Maciej Ulas

This article discuss a class of tractable model in the form of polynomial type.

证券定价 · 定量金融 2016-03-09 Si Cheng , Michael R. Tehranchi

Let G be a connected linear algebraic group over an algebraically closed field k, and let H be a connected closed subgroup of G. We prove that the homogeneous variety G/H is a rational variety over k whenever H is solvable, or when dim(G/H)…

代数几何 · 数学 2018-09-24 CheeWhye Chin , De-Qi Zhang

We investigate which polynomials can possibly occur as factors in the denominators of rational solutions of a given partial linear difference equation (PLDE). Two kinds of polynomials are to be distinguished, we call them /periodic/ and…

符号计算 · 计算机科学 2010-05-05 Manuel Kauers , Carsten Schneider