相关论文: Rectangular Scott-type Permanents

In this paper, we study the Coxeter transformation of the derived categories of coherent sheaves on smooth complete varieties. We first obtain that if the rank of the Grothendieck group is finite, say $m$, then its characteristic…

We use the theory of resultants of polynomials to study the stability of an arbitrary polynomial over a finite field, that is, the property of having all its iterates irreducible. This result partially generalises the quadratic polynomial…

We give a first-order definition of key polynomials, we show the links with previous definitions, that it is relevant to study key degrees, and to use a kind of valuations that we call partially multiplicative. We also prove or reprove…

We present a finite-order system of recurrence relations for a permanent of circulant matrices containing a band of k any-value diagonals on top of a uniform matrix (for k = 1, 2, and 3) as well as the method for deriving such recurrence…

For certain negative rational numbers k, called singular values, and associated with the symmetric group S_N on N objects, there exist homogeneous polynomials annihilated by each Dunkl operator when the parameter equals k. It was shown by…

Previously, the graph permanent was introduced as a single-valued invariant for graphs $G$ with $|E(G)| = k(|V(G)|-1)$ for some $k \in \mathbb{Z}_{>0}$. Herein, we construct the extended graph permanent, an infinite sequence for all graphs.…

We show that the permanent of an $n \times n$ matrix with iid Bernoulli entries $\pm 1$ is of magnitude $n^{({1/2}+o(1))n}$ with probability $1-o(1)$. In particular, it is almost surely non-zero.

We establish expansion properties for suitably generic polynomials of degree $d$ in $d+1$ variables over finite fields. In particular, we show that if $P\in\mathbb{F}_q[x_1,\ldots,x_{d+1}]$ is a polynomial of degree $d$ coming from an…

We characterize ratios of permanents of (generalized) submatrices which are bounded on the set of all totally positive matrices. This provides a permanental analog of results of Fallat, Gekhtman, and Johnson [{\em Adv.\ Appl.\ Math.} {\bf…

Consider a family of planar polynomial systems $\dot x = y^{2l-1} - x^{2k+1}, \dot y =-x +m y^{2s+1},$ where $l,k,s\in\mathbb{N^*},$ $2\le l \le 2s$ and $m\in\mathbb{R}.$ We study the center-focus problem on its origin which is a monodromic…

In this note we settle two open problems in the theory of permanents by using recent results from other areas of mathematics. Bapat conjectured that certain quotients of permanents, which generalize symmetric function means, are concave. We…

Let $\mathcal{F}_n$ be the set of unitary polynomials of degree $n \ge 2$ that have their roots in $\mathbb{Z}^*$. We note $$ Q(x) := x^n+a_{1}x^{n-1}+\dots+a_{n}. $$ We show that any two fixed consecutive coefficients $(a_{j},a_{j+1})$ ($j…

We study Schur Q-polynomials evaluated on a geometric progression, or equivalently q-enumeration of marked shifted tableaux, seeking explicit formulas that remain regular at q=1. We obtain several such expressions as multiple basic…

The purpose of this note is twofold: firstly to characterize all the sequences of orthogonal polynomials $(P_n)_{n\geq 0}$ such that $$ \frac{\triangle}{{\bf \triangle} x(s-1/2)}P_{n+1}(x(s-1/2))=c_n(\triangle +2\,\mathrm{I})P_n(x(s-1/2)),…

For certain negative rational numbers k0, called singular values, and associated with the symmetric group S_N on N objects, there exist homogeneous polynomials annihilated by each Dunkl operator when the parameter k = k0. It was shown by de…

One of the crown jewels of complexity theory is Valiant's 1979 theorem that computing the permanent of an n*n matrix is #P-hard. Here we show that, by using the model of linear-optical quantum computing---and in particular, a universality…

In this article, we study the ideal generated by $2\times 2$ permanents of a symmetric matrix. We denote this ideal by $P_2(X)$ where $X$ is a symmetric matrix. We compute a Gr\"obner basis, dimension, depth, minimal primes, and a primary…

We study the arithmetic circuit complexity of some well-known family of polynomials through the lens of parameterized complexity. Our main focus is on the construction of explicit algebraic branching programs (ABP) for determinant and…

By utilizing domain theory, we generalize the notion of an ephemeral module to the so-called continuous posets. We investigate the quotient category of persistence modules by the Serre subcategory of ephemeral modules and show that it is…

Let $\{\mathbb{P}_n\}_{n\ge 0}$ and $\{\mathbb{Q}_n\}_{n\ge 0}$ be two monic polynomial systems in several variables satisfying the linear structure relation $$\mathbb{Q}_n = \mathbb{P}_n + M_n \mathbb{P}_{n-1}, \quad n\ge 1,$$ where $M_n$…