中文
相关论文

相关论文: Rectangular Scott-type Permanents

200 篇论文

In this paper we consider in detail the composition of an irreducible polynomial with X^2 and suggest a recurrent construction of irreducible polynomials of fixed degree over finite fields of odd characteristics. More precisely, given an…

数论 · 数学 2020-08-26 Gohar M. Kyureghyan , Melsik K. Kyureghyan

In this paper, we give some determinantal and permanental representations of Generalized Fibonacci Polynomials by using various Hessenberg matrices. These results are general form of determinantal and permanental representations of k…

数论 · 数学 2011-11-18 Adem Sahin , Kenan Kaygisiz

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

A $d$-dimensional matrix is called \emph{$1$-polystochastic} if it is non-negative and the sum over each line equals~$1$. Such a matrix that has a single $1$ in each line and zeros elsewhere is called a \emph{$1$-permutation} matrix. A…

组合数学 · 数学 2020-04-30 Billy Child , Ian M. Wanless

Let $P$ be a simple polytope of dimension $n$ with $m$ facets. In this paper we pay our attention on those elementary symmetric polynomials in the Stanley--Reisner face ring of $P$ and study how the decomposability of the $n$-th elementary…

代数拓扑 · 数学 2016-03-01 Zhi Lü , Jun Ma , Yi Sun

We investigate an infinite sequence of polynomials of the form: \[a_0T_{n}(x)+a_{1}T_{n-1}(x)+\cdots+a_{m}T_{n-m}(x)\] where $(a_0,a_1,\ldots,a_m)$ is a fixed m-tuple of real numbers, $a_0,a_m\ne0$, $T_i(x)$ are Chebyshev polynomials of the…

数论 · 数学 2015-07-01 Dragan Stankov

For any finite poset $P$ we have the poset of isotone maps $\text{Hom}(P,\mathbb{N})$, also called $P^{op}$-partitions. To any poset ideal ${\mathcal J}$ in $\text{Hom}(P,\mathbb{N})$, finite or infinite, we associate monomial ideals: the…

交换代数 · 数学 2018-04-26 Gunnar Fløystad

In 2011, Aaronson gave a striking proof, based on quantum linear optics, showing that the problem of computing the permanent of a matrix is #P-hard. Aaronson's proof led naturally to hardness of approximation results for the permanent, and…

量子物理 · 物理学 2018-03-01 Daniel Grier , Luke Schaeffer

In this work we prove a version of the Sylvester-Gallai theorem for quadratic polynomials that takes us one step closer to obtaining a deterministic polynomial time algorithm for testing zeroness of $\Sigma^{[3]}\Pi\Sigma\Pi^{[2]}$…

计算复杂性 · 计算机科学 2020-03-12 Shir Peleg , Amir Shpilka

Persistent tensors, introduced in [Quantum 8 (2024), 1238], and inspired by quantum information theory, form a recursively defined class of tensors that remain stable under the substitution method and thereby yield nontrivial lower bounds…

代数几何 · 数学 2025-10-10 Masoud Gharahi , Giorgio Ottaviani

In this work, orthogonal polynomials satisfying $R_I$ type recurrence relation %$\mathcal{P}_{n+1}(z) = (z-c_n)\mathcal{P}_n(z)-\lambda_n (z-a_n)\mathcal{P}_{n-1}(z),$ with $\mathcal{P}_{-1}(z) = 0$ and $\mathcal{P}_0(z) = 1$ are analyzed…

经典分析与常微分方程 · 数学 2024-05-24 Vinay Shukla , A. Swaminathan

We present two infinite sequences of polynomial eigenfunctions of a Sturm-Liouville problem. As opposed to the classical orthogonal polynomial systems, these sequences start with a polynomial of degree one. We denote these polynomials as…

数学物理 · 物理学 2013-06-20 David Gomez-Ullate , Niky Kamran , Robert Milson

Consider a random polynomial $Q_n$ of degree $n+1$ whose zeroes are i.i.d. random variables $\xi_0,\xi_1,\ldots,\xi_n$ in the complex plane. We study the pairing between the zeroes of $Q_n$ and its critical points, i.e. the zeroes of its…

概率论 · 数学 2018-07-09 Zakhar Kabluchko , Hauke Seidel

We study the irreducibility of Wronskian Hermite polynomials labelled by partitions. It is known that these polynomials factor as a power of x times a remainder polynomial. We show that the remainder polynomial is irreducible for the…

经典分析与常微分方程 · 数学 2020-07-02 Codruţ Grosu , Corina Grosu

Let $V\subset\R^m$ be a convex body, symmetric about all coordinate hyperplanes, and let $\PP_{aV},\, a\ge 0$, be a set of all algebraic polynomials whose Newton polyhedra are subsets of $aV$. We prove a limit equality as $a\to \iy$ between…

经典分析与常微分方程 · 数学 2022-12-26 Michael Ganzburg

Let $(K,v)$ be a henselian valued field. Let $\mathbb{P}^{dless}\subset K[x]$ be the set of monic, irreducible polynomials which are defectless and have degree greater than one. For a certain equivalence relation $\,\approx\,$ on…

代数几何 · 数学 2019-03-19 Nathália Moraes de Oliveira , Enric Nart

Let M be a field of finite type over {\bf Q} and X a variety defined over M. We study when the set {P \in X(K) \mid f^{\circ n} (P) = P for some n \geq 1} is finite for any finite extension fields K of M and for any dominant K-morphisms f :…

代数几何 · 数学 2007-05-23 Shu Kawaguchi

We study the time and space complexity of matrix permanents over rings and semirings.

数据结构与算法 · 计算机科学 2009-04-22 Andreas Björklund , Thore Husfeldt , Petteri Kaski , Mikko Koivisto

We study log-concavity properties of real sequences $(a_n)_{n \ge 0}$ satisfying a $d$-th order linear recurrence whose coefficients are linear functions of $n$; the so-called P-recursive (or holonomic) sequences. Writing the recurrence in…

组合数学 · 数学 2026-04-17 Piero Giacomelli

We present a construction of a certain infinite complete partial order (CPO) that differs from the standard construction used in Scott's denotational semantics. In addition, we construct several other infinite CPO's. For some of those, we…

计算机科学中的逻辑 · 计算机科学 2008-05-28 Genta Ito