Related papers: A Digital Binomial Theorem for Sheffer Sequences
Left-right and conjugation actions on matrix tuples have received considerable attention in theoretical computer science due to their connections with polynomial identity testing, group isomorphism, and tensor isomorphism. In this paper, we…
We prove the multiplicative Thom-Sebastiani rule for Bernstein-Sato polynomials, answering the longstanding questions of Budur and Popa. We generalize the result to the tensor of two effective divisors on the product of two arbitrary…
We propose a framework for bilinear multiplier operators defined via the (bivariate) spectral theorem. Under this framework we prove Coifman-Meyer type multiplier theorems and fractional Leibniz rules. Our theory applies to bilinear…
We present various constructions of sequences of polynomials satisfying the Binomial Theorem in finite characteristic based on the theory of additive polynomials. Various actions on these constructions are also presented. It is an open…
We introduce trim resolutions of complex algebraic varieties, a strengthening of the notion of small resolution. We prove that the characteristic cycle of the intersection cohomology sheaf of a variety admitting a trim resolution is…
It was shown recently that Birkhoff's theorem for doubly stochastic matrices can be extended to unitary matrices with equal line sums whenever the dimension of the matrices is prime. We prove a generalization of the Birkhoff theorem for…
This paper has two primary contributions. First, we explore degenerate Sheffer-type polynomials, a hybrid of higher-order degenerate Bernoulli and Euler polynomials, and derive their properties. Second, assuming that the moment generating…
We present an elementary identity for the cyclotomic polynomials $\Phi_n(X)$ which reflects a kind of multiplicative property of $\Phi_n(X)$ as a function of $n$, and we explore its connections with the properties of other arithmetical…
As an extension of positive and almost positive diagrams and links, we study two classes of links we call successively almost positive and weakly successively almost positive links. We prove various properties of polynomial invariants and…
We show that the theory of derivators (or, more generally, of fibered multiderivators) on all small categories is equivalent to this theory on partially ordered sets, in the following sense: Every derivator (more generally, every fibered…
We consider, over both the integers and finite fields, Szemer\'{e}di's theorem on $k$-term arithmetic progressions where the set $S$ of allowed common differences in those progressions is restricted and random. Fleshing out a line of…
We obtain new partial results supporting the spectral set conjecture in dimension 1.
A sequence inverse relationship can be defined by a pair of infinite inverse matrices. If the pair of matrices are the same, they define a dual relationship. Here presented is a unified approach to construct dual relationships via…
An analogue of Serre's theorem is established for finite dimensional simple Lie superalgebras, which describes presentations in terms of Chevalley generators and Serre type relations relative to all possible choices of Borel subalgebras.…
In this paper we introduce a method of characteristic sets with respect to several term orderings for difference-differential polynomials. Using this technique, we obtain a method of computation of multivariate dimension polynomials of…
In this paper, we introduce the polynomial continued fraction, a close relative of the well-known simple continued fraction expansions which are widely used in number theory and in general. While they may not possess all the intriguing…
We introduce a hybridization of digital sequences with uniformly distributed sequences in the domain of $b$-adic integers, $\mathbb Z_{b}, b\in\mathbb N\setminus\{1\}$, by using such sequences as input for generating matrices. The…
We prove an extension of the Bourgain-Sarnak-Ziegler theorem and then apply it to bound certain polynomial exponential sums with modular coefficients.
We explain an algorithm for finding a boundary link Seifert matrix for a given Alexander polynomial. The algorithm depends on several choices and therefore makes it possible to find non-equivalent Seifert matrices for a given Alexander…
In graph theory, the Szemer\'edi regularity lemma gives a decomposition of the indicator function for any graph $G$ into a structured component, a uniform part, and a small error. This result, in conjunction with a counting lemma that…