Related papers: Evaluation of Sylvester type determinants using bl…
We prove algebraic and combinatorial characterizations of the class of inductively pierced codes, resolving a conjecture of Gross, Obatake, and Youngs. Starting from an algebraic invariant of a code called its canonical form, we explain how…
We propose and analyze a second-order Strang splitting method for a class of stiff matrix differential equations with Sylvester-type structure. The method splits the dynamics into a stiff linear part, treated exactly via matrix…
We conjecture that the complex of Soergel bimodules associated with the full twist braid is categorically diagonalizable, for any finite Coxeter group. This utilizes the theory of categorical diagonalization introduced earlier by the…
In this paper we continue to investigate a certain class of Hankel-like positive definite kernels using their associated orthogonal polynomials. The main result of this paper is about the structure of this kind of kernels.
We study Askey-Wilson type polynomials using representation theory of the double affine Hecke algebra. In particular, we prove bi-orthogonality relations for non-symmetric and anti-symmetric Askey-Wilson polynomials with respect to a…
A numerical method is developed leading to algebraic systems based on generalized Lyapunov-Sylvester operators to approximate the solution of two-dimensional Boussinesq equation. It consists of an order reduction method and a finite…
We compute two parametric determinants in which rows and columns are indexed by compositions, where in one determinant the entries are products of binomial coefficients, while in the other the entries are products of powers. These results…
We present two results, the first on the distribution of the roots of a polynomial over the ring of integers modulo $n$ and the second on the distribution of the roots of the Sylvester resultant of two multivariate polynomials. The second…
In the context of space-time block codes (STBCs), the theory of generalized quaternion and biquaternion algebras (i.e., tensor products of two quaternion algebras) over arbitrary base fields is presented, as well as quadratic form theoretic…
Motives of Brauer-Severi schemes of Cayley-smooth algebras associated to homogeneous superpotentials are used to compute inductively the motivic Donaldson-Thomas invariants of the corresponding Jacobian algebras. This approach can be used…
Following Verde-Star, Linear Algebra Appl. 627 (2021), we label families of orthogonal polynomials in the $q$-Askey scheme together with their $q$-hypergeometric representations by three sequences $x_k, h_k, g_k$ of Laurent polynomials in…
The notion of block divisibility naturally leads one to introduce unitary cyclotomic polynomials. We formulate some basic properties of unitary cyclotomic polynomials and study how they are connected with cyclotomic, inclusion-exclusion and…
We present an algorithm for the solution of Sylvester equations with right-hand side of low rank. The method is based on projection onto a block rational Krylov subspace, with two key contributions with respect to the state-of-the-art.…
We use polynomial techniques to derive structural results on R\'edei type blocking sets from information on their bisecants. We apply our results to point sets of $PG(2,q)$ with few odd-secants. In particular, we improve the lower bound of…
Sylvester equations $AX-XB=C$ have unique solutions for all $C$ when the spectra of $A$ and $B$ are disjoint. Here $A$ and $B$ are bounded operators in Banach spaces. We discuss the existence of polynomials $p$ such that the spectra of…
In this chapter we characterize Askey-Wilson polynomials including specific and limiting cases of them by some structure relations of the first type.
Electronic structure methods that exploit nonorthogonal Slater determinants face the challenge of efficiently computing nonorthogonal matrix elements. In a recent publication, H. G. A. Burton, J. Chem. Phys. 154, 144109 (2021), I introduced…
In a recent work, Jungnickel, Magliveras, Tonchev, and Wassermann derived an overexponential lower bound on the number of nonisomorphic resolvable Steiner triple systems (STS) of order $v$, where $v=3^k$, and $3$-rank $v-k$. We develop an…
Triangular decomposition is one of the standard ways to represent the radical of a polynomial ideal. A general algorithm for computing such a decomposition was proposed by A. Szanto. In this paper, we give the first complete bounds for the…
We suggest a definition of cluster polylogarithms on an arbitrary cluster variety and classify them in type $A$. We find functional equations for multiple polylogarithms which generalize equations discovered by Abel, Kummer, and Goncharov…