Related papers: Evaluation of Sylvester type determinants using bl…

In this paper, a new triangular decomposition algorithm is proposed for ordinary differential polynomial systems, which has triple exponential computational complexity. The key idea is to eliminate one algebraic variable from a set of…

The article presents the theoretical background of the algorithms for solving cyclic block tridiagonal and cyclic block penta-diagonal systems of linear algebraic equations present in ref [1] and [2]. The theory is based on the Woodbury…

We present an effective set of necessary and sufficient criteria for block-positivity of matrices of order $4$ over $\mathbb{C}$. The approach is based on Sturm sequences and quartic polynomial positivity conditions presented in recent…

We introduce and study a new notion of patterns in Stirling and $k$-Stirling permutations, which we call block patterns. We prove a general result which allows us to compute generating functions for the occurrences of various block patterns…

In the paper, the authors find two closed forms involving the Stirling numbers of the second kind and in terms of a determinant of combinatorial numbers for the Bernoulli polynomials and numbers.

A theorem of Pfister asserts that every $12$-dimensional quadratic form with trivial discriminant and trivial Clifford invariant over a field of characteristic different from $2$ decomposes as a tensor product of a binary quadratic form and…

We provide a generalization and new proofs of the formulas of Collins, Hasebe and Sakuma for the spectrum of polynomials in cyclic monotone elements. This is applied to random matrices with discrete spectrum.

In this paper, we demonstrate that many of the computational tools for univariate orthogonal polynomials have analogues for a family of bivariate orthogonal polynomials on the triangle, including Clenshaw's algorithm and sparse…

We present a method of computing elements of spin groups in the case of arbitrary dimension. This method generalizes Hestenes method for the case of dimension 4. We use the method of averaging in Clifford's geometric algebra previously…

We prove a projection formula for the four-parameter family of orthogonal polynomials that are a reparameterization of the polynomials in the Askey-Wilson class. By carefully analyzing the recurrence relations we manage to avoid using the…

We study the properties of Kokotsakis polyhedra of orthodiagonal anti-involutive type. Stachel conjectured that a certain resultant connected to a polynomial system describing flexion of a Kokotsakis polyhedron must be reducible. Izmestiev…

We prove a robust generalization of a Sylvester-Gallai type theorem for quadratic polynomials, generalizing the result in [S'20]. More precisely, given a parameter $0 < \delta \leq 1$ and a finite collection $\mathcal{F}$ of irreducible and…

Say a trinomial $x^n+A x^m+B \in \Q[x]$ has reducibility type $(n_1,n_2,...,n_k)$ if there exists a factorization of the trinomial into irreducible polynomials in $\Q[x]$ of degrees $n_1$, $n_2$,...,$n_k$, ordered so that $n_1 \leq n_2 \leq…

This paper deals with solving a class of three-by-three block saddle point problems. The systems are solved by preconditioning techniques. Based on an iterative method, we construct a block upper triangular preconditioner. The convergence…

Cluster indices describe extremal behaviour of stationary time series. We consider their sliding blocks estimators. Using a modern theory of multivariate, regularly varying time series, we obtain central limit theorems under conditions that…

We give a new proof of a determinant evaluation due to Andrews, which has been used to enumerate cyclically symmetric and descending plane partitions. We also prove some related results, including a q-analogue of Andrews's determinant.

Limiting cases are studied of the Koornwinder-Macdonald multivariable generalization of the Askey-Wilson polynomials. We recover recently and not so recently introduced families of hypergeometric orthogonal polynomials in several variables…

In this paper stochastic Volterra equations admitting exponentially bounded resolvents are studied. After obtaining convergence of resolvents, some properties of stochastic convolutions are given. The paper provides a sufficient condition…

I propose an orthogonalization procedure preserving the grading of the initial graded set of linearly independent vectors. In particular, this procedure is applicable for orthonormalization of any countable set of polynomials in several…

This paper sets out to introduce the generalized derangement polynomials of order $r $. It then proceeds to establish various identities associated with these polynomials, along with providing recurrence relations for derangement…