Related papers: Intersection matrices revisited

We introduce a new family of hyperplane arrangements inspired by the homogenized Linial arrangement (which was recently introduced by Hetyei), and show that the intersection lattices of these arrangements are isomorphic to the bond lattices…

Extending early work, we formulate the large N matrix mechanics of general bosonic, fermionic and supersymmetric matrix models, including Matrix theory: The Hamiltonian framework of large N matrix mechanics provides a natural setting in…

We introduce the tools of intersection theory to the study of Feynman integrals, which allows for a new way of projecting integrals onto a basis. In order to illustrate this technique, we consider the Baikov representation of maximal cuts…

We evaluate four families of determinants of matrices, where the entries are sums or differences of generating functions for paths consisting of up-steps, down-steps and level steps. By specialisation, these determinant evaluations have…

We use production matrices to count several classes of geometric graphs. We present novel production matrices for non-crossing partitions, connected geometric graphs, and k-angulations, which provide another way of counting the number of…

Intersection graphs are very important in both theoretical as well as application point of view. Depending on the geometrical representation, different type of intersection graphs are defined. Among them interval, circular-arc, permutation,…

Let R be a commutative ring with identity and M be an R-module. In this paper, we introduce and investigate the second submodule intersection graph SSI(M) of M with vertices are nonzero proper submodules of M and two distinct vertices N and…

We initiate and study the theory of ``real decomposable maps" between real operator systems. Formally, this is new even in the complex case, which hitherto has restricted itself to the case where the systems are complex C*-algebras. We…

This contribution summarizes recent work of the authors that combines methods from dynamical systems theory (discrete Painlev\'e equations) and asymptotic analysis of orthogonal polynomial recurrences, to address long-standing questions in…

We propose a new method for the evaluation of intersection numbers for twisted meromorphic $n$-forms, through Stokes' theorem in $n$ dimensions. It is based on the solution of an $n$-th order partial differential equation and on the…

We use a unified framework to summarize sixteen randomized iterative methods including Kaczmarz method, coordinate descent method, etc. Some new iterative schemes are given as well. Some relationships with \textsc{mg} and \textsc{ddm} are…

We study macroscopic observables of large random matrices introduced by Pennington and Worah, defined by applying entry wise a non linear function on a product of matrices with independent entries. We allow the variance of the entries of…

This article is a short review on the relationship between convergent matrix integrals, formal matrix integrals, and combinatorics of maps. We briefly summarize results developed over the last 30 years, as well as more recent discoveries.…

Let $W_{k,n}^{i}(m)$ denote a matrix with rows and columns indexed by the $k$-subsets and $n$-subsets, respectively, of an $m$-element set. The row $S$, column $T$ entry of $W_{k,n}^{i}(m)$ is $1$ if $|S \cap T| = i$, and is $0$ otherwise.…

Matroid is a generalization of many fundamental objects in combinatorial mathematics , and matroid intersection problem is a classical subject in combinatorial optimization . However , only the intersection of two matroids are well…

Let $k$, $t$ and $m$ be positive integers. A $k$-multiset of $[m]$ is a collection of $k$ integers from the set $\{1,...,m\}$ in which the integers can appear more than once. We use graph homomorphisms and existing theorems for intersecting…

In this paper, we obtain some new results on closed subschemes. Specially, we define natural addition and multiplication on the closed subschemes of a scheme. It is shown that "the multiplication" precisely coincides with the well known…

We consider algorithms with access to an unknown matrix $M\in\mathbb{F}^{n \times d}$ via matrix-vector products, namely, the algorithm chooses vectors $\mathbf{v}^1, \ldots, \mathbf{v}^q$, and observes $M\mathbf{v}^1,\ldots,…

The numerical Hilbert series combinatorics and the comodule Hilbert series combinatorics are introduced, and some applications are presented, including the MacMahon Master Theorem.

In this note, we present an algorithm that yields many new methods for constructing doubly stochastic and symmetric doubly stochastic matrices for the inverse eigenvalue problem. In addition, we introduce new open problems in this area that…