Related papers: Incidence Hypergraphs: Box Products & the Laplacia…
We present algorithms and heuristics to compute the characteristic polynomial of a matrix given its minimal polynomial. The matrix is represented as a black-box, i.e., by a function to compute its matrix-vector product. The methods apply to…
Given any diagram of a link, we define on the cube of Kauffman's states a "2-complex" whose homology is an invariant of the associated framed links, and such that the graded Euler characteristic reproduces the unnormalized Kauffman bracket.…
We describe a family of quantum error-correcting codes which generalize both the quantum hypergraph-product (QHP) codes by Tillich and Z\'emor, and all families of toric codes on $m$-dimensional hypercubic lattices. Similar to the latter,…
In a sufficiently rich category, such as a category of R-modules, and a given infinite cardinal $\kappa$, we examine classes $\Cal H^\kappa_*$ of objects M, such that the following natural monomorphism is an isomorphism: $$\prod_{i\in…
The hypergraph container lemma is a powerful tool in probabilistic combinatorics that has found many applications since it was first proved a decade ago. Roughly speaking, it asserts that the family of independent sets of every uniform…
This paper discusses some issues arising from the category $\mathfrak{H}$ of hypergraphs, the category $\mathfrak{M}$ of (undirected) multigraphs, and the topos $\mathfrak{Q}$ of quivers. First, the natural inclusion of $\mathfrak{M}$ into…
The ordinary generating function of the number of complete subgraphs (cliques) of $G$, denoted by $C(G,x)$, is called the The clique polynomial of the graph $G$. In this paper, we first introduce some \emph{clique} incidence matrices…
We construct explicit invariant measures for a family of infinite products of random, independent, identically-distributed elements of SL(2,C). The matrices in the product are such that one entry is gamma-distributed along a ray in the…
Let $G=(V,E)$ be a graph. A set of vertices $A$ is an incidence generator for $G$ if for any two distinct edges $e,f\in E(G)$ there exists a vertex from $A$ which is an endpoint of either $e$ or $f$. The smallest cardinality of an incidence…
Over the moduli space of pointed smooth algebraic curves, the projectivized $k$-th Hodge bundle is the space of $k$-canonical divisors. The incidence loci are defined by requiring the $k$-canonical divisors to have prescribed multiplicities…
In recent years, sum-product estimates in Euclidean space and finite fields have been studied using a variety of combinatorial, number theoretic and analytic methods. Erdos type problems involving the distribution of distances, areas and…
The semidirect product of a finitely generated group dual with the symmetric group can be described through so-called group-theoretical categories of partitions (covers only a special case; due to Raum--Weber, 2015) and skew categories of…
The relationships between eigenvalues and eigenvectors of a product graph and those of its factor graphs have been known for the standard products, while characterization of Laplacian eigenvalues and eigenvectors of the Kronecker product of…
We investigate how coarse embeddability of box spaces into Hilbert space behaves under group extensions. In particular, we prove a result which implies that a semidirect product of a finitely generated free group by a finitely generated…
Horizontal visibility graphs (HVGs) are graphs constructed in correspondence with number sequences that have been introduced and explored recently in the context of graph-theoretical time series analysis. In most of the cases simple…
Co-occurence networks can be adequately modeled by hyper-bag-graphs (hb-graphs for short). A hb-graph is a family of multisets having same universe, called the vertex set. An efficient exchange-based diffusion scheme has been previously…
There are various results connecting ranks of incidence matrices of graphs and hypergraphs with their combinatorial structure. Here, we consider the generalized incidence matrix $N_2$ (defined by inclusion of pairs in edges) for one natural…
A Hadamard-Hitchcock decomposition of a multidimensional array is a decomposition that expresses the latter as a Hadamard product of several tensor rank decompositions. Such decompositions can encode probability distributions that arise…
A Hamilton cycle in a digraph is a cycle that passes through all the vertices, where all the arcs are oriented in the same direction. The problem of finding Hamilton cycles in directed graphs is well studied and is known to be hard. One of…
It is well-known that biological phenomena are emergent. Emergent phenomena are quite interesting and amazing. However, they are difficult to be understood. Due to this difficulty, we propose a theory to describe emergence based on a…