中文
相关论文

相关论文: Repr\'esentations d\'eterminantales effectives des…

200 篇论文

In this paper, the changes of representations of a group are used in order to describe its action as algebraic Galois group of an univariate polynomial on the roots of factors of any Lagrange resolvent. By this way, the Galois group of…

符号计算 · 计算机科学 2009-04-27 Annick Valibouze

In this paper, we consider the problem of representing any polynomial in terms of the ordered Bell and degenerate ordered Bell polynomials, and more generally of the higher-order ordered Bell and higher-order degenerate ordered Bell…

数论 · 数学 2021-10-08 Dae san Kim , Taekyun Kim

Here we consider the image of the principal minor map of symmetric matrices over an arbitrary unique factorization domain $R$. By exploiting a connection with symmetric determinantal representations, we characterize the image of the…

代数几何 · 数学 2021-05-31 Abeer Al Ahmadieh , Cynthia Vinzant

The coefficients of the chain polynomial of a finite poset enumerate chains in the poset by their number of elements. The chain polynomials of the partition lattices and their standard type $B$ analogues are shown to have only real roots.…

组合数学 · 数学 2023-01-03 Christos A. Athanasiadis , Katerina Kalampogia-Evangelinou

We lift to the multivariate Eulerian polynomials the identity implying that univariate Eulerian polynomials are palindromic. As a consequence of this generalization, we obtain nice combinatorial identities that can be directly extracted…

组合数学 · 数学 2026-01-23 Alejandro González Nevado

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…

复变函数 · 数学 2008-06-16 Elin Götmark

We show that a monic univariate polynomial over a field of characteristic zero, with $k$ distinct non-zero known roots, is determined by its $k$ proper leading coefficients by providing an explicit algorithm for computing the multiplicities…

组合数学 · 数学 2018-06-15 Gregory J. Clark , Joshua N. Cooper

We consider the set of $n\times n$ matrices with rational entries having numerator and denominator of size at most $H$ and obtain upper and lower bounds on the number of such matrices of a given rank and then apply them to count such…

Polynomial algebra offers a standard approach to handle several problems in geometric modeling. A key tool is the discriminant of a univariate polynomial, or of a well-constrained system of polynomial equations, which expresses the…

代数几何 · 数学 2013-04-23 Alicia Dickenstein , Ioannis Emiris , Anna Karasoulou

We prove that a bivariate polynomial f with exactly t non-zero terms, restricted to a real line {y=ax+b}, either has at most 6t-4 zeroes or vanishes over the whole line. As a consequence, we derive an alternative algorithm to decide whether…

代数几何 · 数学 2007-05-23 Martin Avendano

We give a simpler proof of an earlier result giving an asymptotic estimate for the number of integral matrices, in large balls, with a given monic integral irreducible polynomial as their common characteristic polynomial. The proof uses…

表示论 · 数学 2011-11-10 Nimish A. Shah

In this paper polynomial maps are represented by the use of matrices whose entries are numbered by pair of multiindices and a new product of such matrices is introduced. A matrix representation of composition of polynomial maps is given. In…

交换代数 · 数学 2009-09-22 Ural Bekbaev

Let $f(q)=a_rq^r+\cdots+a_sq^s$, with $a_r\neq 0$ and $a_s\neq 0$, be a real polynomial. It is a palindromic polynomial of darga $n$ if $r+s=n$ and $a_{r+i}=a_{s-i}$ for all $i$. Polynomials of darga $n$ form a linear subspace…

组合数学 · 数学 2016-01-22 Hua Sun , Yi Wang , Hai-Xia Zhang

In this paper we consider polynomial representability of functions defined over $Z_{p^n}$, where $p$ is a prime and $n$ is a positive integer. Our aim is to provide an algorithmic characterization that (i) answers the decision problem: to…

符号计算 · 计算机科学 2015-02-16 Ashwin Guha , Ambedkar Dukkipati

We study higher order determinantal varieties obtained by considering generic $m\times n$ ($m \le n$) matrices over rings of the form $F[t]/(t^k)$, and for some fixed $r$, setting the coefficients of powers of $t$ of all $r \times r$ minors…

代数几何 · 数学 2007-05-23 Tomaz Kosir , B. A. Sethuraman

We study the rational approximation properties of special manifolds defined by a set of polynomials with rational coefficients. Mostly we will assume the case of all polynomials to depend on only one variable. In this case the manifold can…

数论 · 数学 2018-12-31 Johannes Schleischitz

In this paper, we prove a number of results providing either necessary or sufficient conditions guaranteeing that the number of real roots of real polynomials of a given degree is either less or greater than a given number. We also provide…

复变函数 · 数学 2024-03-20 Olga Katkova , Boris Shapiro , Anna Vishnyakova

Every bi-uniform matroid is representable over all sufficiently large fields. But it is not known exactly over which finite fields they are representable, and the existence of efficient methods to find a representation for every given…

组合数学 · 数学 2014-07-29 Simeon Ball , Carles Padró , Zsuzsa Weiner , Chaoping Xing

This work is divided into three parts. The first part concerns polynomials in one variable with all real roots. We consider linear transformations that preserve real rootedness, as well as matrices that preserve interlacing. The second part…

经典分析与常微分方程 · 数学 2008-03-11 Steve Fisk

We study a coarse moduli space of irreducible representations of the group of unipotent matrices of order $\mathbb{4}$ over the ring of integers which have finite weight. All such representations are known to be monomial. To describe a…

表示论 · 数学 2018-04-16 Iuliya Beloshapka