Related papers: A classification of restrictive polynomial corresp…

Let $P: \F \times \F \to \F$ be a polynomial of bounded degree over a finite field $\F$ of large characteristic. In this paper we establish the following dichotomy: either $P$ is a moderate asymmetric expander in the sense that $|P(A,B)|…

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…

We introduce and characterize a particularly tractable class of unital type 1 C*-algebras with bounded dimension of irreducible representations. Algebras in this class are called recursive subhomogeneous algebras, and they have an inductive…

We obtain new recurrence relations, an explicit formula, and convolution identities for higher order geometric polynomials. These relations generalize known results for geometric polynomials, and lead to congruences for higher order…

We define a regular polynomial skew product $(p(z),q(z,w))$ of $\mathbb{C}^2$ of degree $d\geq 2$ to be special if it is triangularly conjugate to a map of the form $(p(z),q(w))$, where $p$ and $q$ are power maps or $\pm$Chebyshev maps, or…

For the algebraic group $SL_{l+1}(\mathbb{C})$ we describe a system of positive roots associated to conjugacy classes in its Weyl group. Using this we explicitly describe the algebra of regular functions on certain transverse slices to…

Arthur Cohn's irreducibility criterion for polynomials with integer coefficients and its generalization connect primes to irreducibles, and integral bases to the variable $x$. As we follow this link, we find that these polynomials are ready…

We discuss the notion of privileged word, recently introduced by Peltomaki. A word w is privileged if it is of length <=1, or has a privileged border that occurs exactly twice in w. We prove the following results: (1) if w^k is privileged…

In this paper we consider a restricted class of convex polyominoes that we call Z-convex polyominoes. Z-convex polyominoes are polyominoes such that any two pairs of cells can be connected by a monotone path making at most two turns (like…

A Littlewood polynomial is a single-variable polynomial all of whose coefficients lie in $\{ \pm 1\}$. We establish the leading term asymptotics of the number of reciprocal or skew-reciprocal Littlewood polynomials with square discriminant.…

In this short paper, we extend the concept of the strict order polynomial $\Omega_{P}^{\circ}(n)$, which enumerates the number of strict order-preserving maps $\phi:P\rightarrow\boldsymbol{n}$ for a poset $P$, to the extended strict order…

Let $P=\{p_{1},\ld,p_{r}\}\subset\Q[n_{1},\ld,n_{m}]$ be a family of polynomials such that $p_{i}(\Z^{m})\sle\Z$, $i=1,\ld,r$. We say that the family $P$ has {\it PSZ property} if for any set $E\sle\Z$ with…

We obtain various irreducibility criteria for pairs of polynomials $(f(X),g(X))$ with integer coefficients whose resultant $Res(f,g)$ is a prime number, or is divisible by a sufficiently large prime number, and also for some of their linear…

We show that the principal specialization of the Schubert polynomial at $w$ is bounded below by $1+p_{132}(w)+p_{1432}(w)$ where $p_u(w)$ is the number of occurrences of the pattern $u$ in $w$, strengthening a previous result by A.…

Correspondence is a ubiquitous problem in computer vision and graph matching has been a natural way to formalize correspondence as an optimization problem. Recently, graph matching solvers have included higher-order terms representing…

Consider $\{p_n\}_{n=0}^{\infty}$, a sequence of polynomials orthogonal with respect to $w(x)>0$ on $(a,b)$, and polynomials $\{g_{n,k}\}_{n=0}^{\infty},k \in \mathbb{N}_0$, orthogonal with respect to $c_k(x)w(x)>0$ on $(a,b)$, where…

We study the asymptotics and fine-scale behavior of quantitative combinatorial measures of infinite words and related dynamical and algebraic structures. We construct infinite recurrent words $w$ whose complexity functions $p_w(n)$ are…

We say that a function is rare-case hard against a given class of algorithms (the adversary) if all algorithms in the class can compute the function only on an $o(1)$-fraction of instances of size $n$ for large enough $n$. Starting from any…

Let $S \subset R$ be an arbitrary subset of a unique factorization domain $R$ and $\K$ be the field of fractions of $R$. The ring of integer-valued polynomials over $S$ is the set $\mathrm{Int}(S,R)= \{ f \in \mathbb{K}[x]: f(a) \in R\…

We observe that a term of the WZW-type can be added to the Lagrangian of the Poisson Sigma model in such a way that the algebra of the first class constraints remains closed. This leads to a natural generalization of the concept of Poisson…