Related papers: Symmetric and skew-symmetric block-Kronecker linea…
The aim of this survey is to outline the state of the art in research on a class of linearized polynomials with coefficients over finite fields, known as scattered polynomials. These have been studied in several contexts, such as in [A.…
The classical Kepler-Coulomb system in 3 dimensions is well known to be 2nd order superintegrable, with a symmetry algebra that closes polynomially under Poisson brackets. This polynomial closure is typical for 2nd order superintegrable…
The class of strictly sign regular (SSR) matrices has been extensively studied by many authors over the past century, notably by Schoenberg, Motzkin, Gantmacher, and Krein. A classical result of Gantmacher-Krein assures the existence of SSR…
Linear recurrent sequences are those whose elements are defined as linear combinations of preceding elements, and finding recurrence relations is a fundamental problem in computer algebra. In this paper, we focus on sequences whose elements…
The problem of block diagonalization for diagonally dominant symmetric block operator matrices with self-adjoint diagonal entries is considered. We show that a reasonable block diagonalization with respect to a reducing graph subspace…
We analyze the effect of symmetrization in the theory of multiple orthogonal polynomials. For a symmetric sequence of type II multiple orthogonal polynomials satisfying a high-term recurrence relation, we fully characterize the Weyl…
We examine a variant of hypergraphs that we call interfaced linear hypergraphs, with the aim of creating a sound and complete graphical language for symmetric traced monoidal categories (STMCs) suitable for graph rewriting. In particular,…
We give a method for constructing a regularizing decomposition of a matrix pencil, which is formulated in terms of the linear mappings. We prove that two pencils are topologically equivalent if and only if their regularizing decompositions…
In this paper, we answer some natural questions on symmetrisation and more general combinations of Finsler metrics, with a view towards applications to Funk and Hilbert geometries and to metrics on Teichm{\"u}ller spaces. For a general…
We define a family of symmetric and a family of non-symmetric polynomials in terms of vanishing conditions. These families depend on two paramters, q and t. Their main feature is that they consist of non-homogeneous polynomials. The…
Thanks to its great potential in reducing both computational cost and memory requirements, combining sketching and Krylov subspace techniques has attracted a lot of attention in the recent literature on projection methods for linear…
Generalizing work of I. Baykur, K. Hayano, and N. Monden (arXiv:1903.02906), we construct infinite families of symplectic 4-dimensional manifolds, obtained as total spaces of Lefschetz pencils constructed by explicit monodromy…
We introduce a set of combinatorial techniques for studying the simplicial bounded cohomology of semi-simplicial sets, simplicial complexes and posets. We apply these methods to prove several new bounded acyclicity results for…
In this article, families of non-linear subdivision schemes are presented that are based on univariate polynomials up to degree three. Theses families of schemes are constructed by using dynamic iterative re-weighed least squares method.…
We define and study a class of Reed-Muller type error-correcting codes obtained from elementary symmetric functions in finitely many variables. We determine the code parameters and higher weight spectra in the simplest cases.
We develop a general finite-alphabet framework for Euler-type sums based on the notion of a monoidal alphabet. An alphabet of summand letters is called monoidal when it is closed under pointwise multiplication, thereby inducing the usual…
When $\lambda$ is a partition, the specialized non-symmetric Macdonald polynomial $E_{\lambda}(x;q;0)$ is symmetric and related to a modified Hall--Littlewood polynomial. We show that whenever all parts of the integer partition $\lambda$ is…
In this article, we introduce the $k$-th collineation variety of a third order tensor. This is the closure of the image of the rational map of size $k$ minors of a matrix of linear forms associated to the tensor. We classify such varieties…
An explicit structure relation for Askey-Wilson polynomials is given. This involves a divided q-difference operator which is skew symmetric with respect to the Askey-Wilson inner product and which sends polynomials of degree n to…
Two approaches to Lipschitz structures for any set are presented, studied and compared. The first approach is similar to the one proposed in Fraser, Jr. R. B., Axiom systems for Lipschitz structures, Fundamenta Mathematicae, (1970), where…