Related papers: Permanents, Determinants, Weighted Isobaric Polyno…
A cubic polynomial $f$ with a periodic Siegel disk containing an eventual image of a critical point is said to be a \emph{Siegel capture polynomial}. If the Siegel disk is invariant, we call $f$ a \emph{IS-capture polynomial} (or just an…
Integer partitions express the different ways that a positive integer may be written as a sum of positive integers. Here we explore the analytic properties of a new polynomial $f_\lambda(x)$ that we call the partition polynomial for the…
Integer weighing matrices (IW-matrices for short) are integer valued orthogonal square matrices. One usecase of these is to create classical weighing matrices with various block structures. In this paper we study and classify the space…
The problem of writing real zero polynomials as determinants of linear matrix polynomials has recently attracted a lot of attention. Helton and Vinnikov have proved that any real zero polynomial in two variables has a determinantal…
In previous work on Clebsch-Gordan coefficients, certain remarkable hexagonal arrays of integers are constructed that display behaviors found in Pascal's Triangle. We explain these behaviors further using the binomial transform and discrete…
An \emph{interval vector} is a $(0,1)$-vector in $\mathbb{R}^n$ for which all the 1's appear consecutively, and an \emph{interval-vector polytope} is the convex hull of a set of interval vectors in $\mathbb{R}^n$. We study three particular…
Integer programs (IPs) on constraint matrices with bounded subdeterminants are conjectured to be solvable in polynomial time. We give a strongly polynomial time algorithm to solve IPs where the constraint matrix has bounded subdeterminants…
We introduce a family of weight matrices $W$ of the form $T(t)T^*(t)$, $T(t)=e^{\mathscr{A}t}e^{\mathscr{D}t^2}$, where $\mathscr{A}$ is certain nilpotent matrix and $\mathscr{D}$ is a diagonal matrix with negative real entries. The weight…
We characterize all linear operators on finite or infinite-dimensional spaces of univariate real polynomials preserving the sets of elliptic, positive, and non-negative polynomials, respectively. This is done by means of Fischer-Fock…
Universality of eigenvalue spacings is one of the basic characteristics of random matrices. We give the precise meaning of universality and discuss the standard universality classes (sine, Airy, Bessel) and their appearance in unitary,…
We define two new families of polynomials that generalize permanents and prove upper and lower bounds on their determinantal complexities comparable to the known bounds for permanents. One of these families is obtained by replacing…
For a real number $t$, let $r_\ell(t)$ be the total weight of all $t$-large Schr\"{o}der paths of length $\ell$, and $s_\ell(t)$ be the total weight of all $t$-small Schr\"{o}der paths of length $\ell$. For constants $\alpha, \beta$, in…
In this paper, we construct the supersymmetric spinning polynomials. These are orthogonal polynomials that serve as an expansion basis for the residue or discontinuity of four-point scattering amplitudes, respecting four-dimensional super…
In this article we study $p$-adic properties of sequences of integers (or $p$-adic integers) that satisfy a linear recurrence with constant coefficients. For such a sequence, we give an explicit approximate twisted interpolation to $\mathbb…
It is proved that every linear biseparating map between spaces of vector-valued differentiable functions is a weighted composition map. As a consequence, such a map is always continuous.
For a Weyl group W, we give a simple closed formula (valid on elliptic conjugacy classes) for the character of the representation of W in each A-isotypic component of the full homology of a Springer fiber. We also give a formula (valid…
Cohesive powers of computable structures can be viewed as effective ultraproducts over effectively indecomposable sets called cohesive sets. We investigate the isomorphism types of cohesive powers $\Pi _{C}% \mathcal{L}$ for familiar…
This paper is devoted to the structure of the complete asymptotic expansion of the probability that a large combinatorial object is irreducible or consists of a given number of irreducible parts, where irreducibility is understood in terms…
In this paper, we use the tools of Gr\"{o}bner bases and combinatorial secant varieties to study the determinantal ideals $I_t$ of the extended Hankel matrices. Denote by $c$-chain a sequence $a_1,\...,a_k$ with $a_i+c<a_{i+1}$ for all…
Let $E_k$ be the normalized Eisenstein series of weight $k$ on $\mathrm{SL}_{2}(\mathbb{Z})$. Let $\varphi_k$ be the polynomial that encodes the $j$-invariants of non-elliptic zeros of $E_k$. In 2001, Gekeler observed that the polynomials…