Related papers: A classification of restrictive polynomial corresp…
We consider absolutely irreducible polynomials $f \in Z[x,y]$ with $\deg_x(f)=m$, $\deg_y(f)=n$ and height $H$. We show that for any prime $p$ with $p>c_{mn} H^{2mn+n-1}$ the reduction $f \bmod p$ is also absolutely irreducible. Furthermore…
In an earlier paper we showed that we can improve results by Emmy Noether and Alexander Ostrowski concerning the reducibility modulo p of absolutely irreducible polynomials with integer coefficients by giving the problem a geometric turn…
The Pascal matrix, $P$, is an upper diagonal matrix whose entries are the binomial coefficients. In 1993 Call and Velleman demonstrated that it satisfies the beautiful relation $P=\exp(H)$ in which $H$ has the numbers 1, 2, 3, etc. on its…
We introduce the Z-polynomial of a matroid, which we define in terms of the Kazhdan-Lusztig polynomial. We then exploit a symmetry of the Z-polynomial to derive a new recursion for Kazhdan-Lusztig coefficients. We solve this recursion,…
We consider the polynomial representation S(V*) of the rational Cherednik algebra H_c(W) associated to a finite Coxeter group W at constant parameter c. We show that for any degree d of W and nonnegative integer m the space S(V*) contains a…
This paper introduces a novel class of prime-generating quadratic polynomials defined by $f_{Z,k,H}(n) = n^2 - (2Zk - 1)n + \frac{(2Zk - 1)^2 + H}{4}$, where $Zk \in \mathbb{Z}_{\geq 0}$ and $H$ belongs to the set of Heegner numbers. This…
We study the complexity classes P and NP through a semigroup fP ("polynomial-time functions"), consisting of all polynomially balanced polynomial-time computable partial functions. Then P is not equal to NP iff fP is a non-regular…
We classify the simple restricted modules for the minimal $p$-envelope of the non-graded, non-restricted Hamiltonian Lie algebra $H(2; (1,1); \Phi(1))$ over an algebraically closed field $k$ of characteristic $p \geq 5$. We also give the…
This paper is concerned with the distribution in the complex plane of the roots of a polynomial sequence $\{W_n(x)\}_{n\ge0}$ given by a recursion $W_n(x)=aW_{n-1}(x)+(bx+c)W_{n-2}(x)$, with $W_0(x)=1$ and $W_1(x)=t(x-r)$, where $a>0$,…
A polynomial ring with rational coefficients is an irreducible representation of Lie algebras of endomorphisms of exterior powers of a infinite countable dimensional $\mathbb{Q}$-vector space. We give an explicit description of it, using…
In this paper, we study genus $0$ equivariant relative Gromov-Witten invariants of $\mathbb{P}^1$ whose corresponding relative stable maps are totally ramified over one point. For fixed number of marked points, we show that such invariants…
This work is a study of polynomial compositions having a fixed number of terms. We outline a recursive method to describe these characterizations, give some particular results and discuss the general case. In the final sections, some…
Let $X\subset \mathbb {P}^r$ be an integral and non-degenerate variety. For any $q\in \mathbb {P}^r$ let $r_X(q)$ be its $X$-rank and $\mathcal {S} (X,q)$ the set of all finite subsets of $X$ such that $|S|=r_X(q)$ and $q\in \langle…
We study the transference through finite index extensions of the notion of equational coherence, as well as its effective counterpart. We deduce an explicit algorithm for solving the following algorithmic problem about size two integral…
We study structural aspects of randomized parameterized computation. We introduce a new class ${\sf W[P]}$-${\sf PFPT}$ as a natural parameterized analogue of ${\sf PP}$. Our definition uses the machine based characterization of the…
In a previous paper, we showed how to use the Ehrhart function $L_P(s)$, defined by $L_P(s) = \#(sP \cap \mathbb Z^d)$, to reconstruct a polytope $P$. More specifically, we showed that, for rational polytopes $P$ and $Q$, if $L_{P + w}(s) =…
We prove that each bounded polytope can be represented as a polynomial zonotope, which we refer to as the Z-representation of polytopes. Previous representations are the vertex representation (V-representation) and the halfspace…
Linearity and ramification constraints have been widely used to weaken higher-order (primitive) recursion in such a way that the class of representable functions equals the class of polytime functions. We show that fine-tuning these two…
We prove that if $\sigma \in S_m$ is a pattern of $w \in S_n$, then we can express the Schubert polynomial $\mathfrak{S}_w$ as a monomial times $\mathfrak{S}_\sigma$ (in reindexed variables) plus a polynomial with nonnegative coefficients.…
A first-order formula is called primitive positive (pp) if it only admits the use of existential quantifiers and conjunction. Pp-formulas are a central concept in (fixed-template) constraint satisfaction since CSP($\Gamma$) can be viewed as…