Related papers: Intersection matrices revisited
Different types of convolution operations involving large Vandermonde matrices are considered. The convolutions parallel those of large Gaussian matrices and additive and multiplicative free convolution. First additive and multiplicative…
We define recurrence matrices and study a few properties (links with automatic sequences, branch groups etc.) of them.
A new framework is proposed to study rank-structured matrices arising from discretizations of 2D and 3D elliptic operators. In particular, we introduce the notion of a graph-induced rank structure (GIRS) which aims to capture the fine low…
We derive an explicit generating function of correlations functions of an arbitrary tau-function of the KdV hierarchy. In particular applications, our formulation gives closed formul\ae\ of a new type for the generating series of…
In their recent inspiring paper Mironov and Morozov claim a surprisingly simple expansion formula for the Kontsevich-Witten tau-function in terms of the Schur Q-functions. Here we provide a similar conjecture for the Br\'ezin-Gross-Witten…
The diffraction of various random subsets of the integer lattice $\mathbb{Z}^{d}$, such as the coin tossing and related systems, are well understood. Here, we go one important step beyond and consider random point sets in $\mathbb{R}^{d}$.…
In this paper, we introduce a matrix for a mixed graph, called the integrated adjacency matrix. This matrix uniquely determines a mixed graph, as long as the indices of the matrix are specified. Additionally, we associate an (undirected)…
We generalize several important results from the perturbation theory of linear operators to the setting of semisimple orthogonal symmetric Lie algebras. These Lie algebras provide a unifying framework for various notions of matrix…
We prove new bijections between different variants of Dyck paths and integer compositions, which give combinatorial explanations of their simple counting formula $4^{n-1}$. These give relations between different statistics, such as the…
Intersection numbers are rational scalar products among functions that admit suitable integral representations, such as Feynman integrals. Using these scalar products, the decomposition of Feynman integrals into a basis of linearly…
Matrices are typically considered over fields or rings. Motivated by applications in parametric differential equations and data-driven modeling, we suggest to study matrices with entries from a Hilbert space and present an elementary theory…
Equiangular Algorithm generates a set of equiangular normalized vectors with given angle {\theta} using a set of linearly independence vectors in a real inner product space, which span the same subspaces. The outcome of EA on column vectors…
We establish an efficient compatibility criterion for a system of generalized complete intersection type in terms of certain multi-brackets of differential operators. These multi-brackets generalize the higher Jacobi-Mayer brackets,…
We study algebraic aspects of Kontsevich integrals as generating functions for intersection theory over moduli space and review the derivation of Virasoro and KdV constraints. 1. Intersection numbers 2. The Kontsevich integral 2.1. The main…
A novel factorization for the sum of two single-pair matrices is established as product of lower-triangular, tridiagonal, and upper-triangular matrices, leading to semi-closed-form formulas for tridiagonal matrix inversion. Subsequent…
The notion of disjoint weighing matrices is introduced as a generalization of orthogonal designs. A recursive construction along with a computer search lead to some infinite classes of disjoint weighing matrices, which in turn are shown to…
Looking at incidence matrices of $t$-$(v,k,\lambda)$ designs as $v \times b$ matrices with $2$ possible entries, each of which indicates incidences of a $t$-design, we introduce the notion of a $c$-mosaic of designs, having the same number…
The theory of Q-Cartier divisors on the space of n-pointed, genus 0, stable maps to projective space is considered. Generators and Picard numbers are computed. A recursive algorithm computing all top intersection products of Q-Divisors is…
We consider shifts of a set $A\subseteq\mathbb{N}$ by elements from another set $B\subseteq\mathbb{N}$, and prove intersection properties according to the relative asymptotic size of $A$ and $B$. A consequence of our main theorem is the…
In this survey, we have attempted to show some developmental milestones on the characterizations of intersection graphs of hypergraphs. The theory of intersection graphs of hypergraphs has been a classical topic in the theory of special…