Related papers: Incidence Hypergraphs: Box Products & the Laplacia…
We apply symmetric function theory to study random processes formed by singular values of products of truncations of Haar distributed symplectic and orthogonal matrices. These product matrix processes are degenerations of Macdonald…
We show that for a closed embedding $\mathbb{H}\le \mathbb{G}$ of locally compact quantum groups (LCQGs) with $\mathbb{G}/\mathbb{H}$ admitting an invariant probability measure, a unitary $\mathbb{G}$-representation is type-I if its…
Graphs derived from groups are a widely studied class of graphs, motivated by their highly symmetric structure. In particular, G-graphs offer an easy and interesting alternative construction of semi-symmetric graphs. After recalling the…
An axis-parallel b-dimensional box is a Cartesian product $R_1 \times R_2 \times ... \times R_b$ where each $R_i$ (for $1 \leq i \leq b$) is a closed interval of the form $[a_i,b_i]$ on the real line. The boxicity of any graph $G$, box(G)…
In this paper, we investigate the subset obtained by evaluations of a fixed multilinear polynomial on a given algebra. We provide an example of a multilinear polynomial, whose image is not a vector subspace; namely, the product of two…
Given a graph $H$ and a natural number $n$, the extremal number $\mathrm{ex}(n, H)$ is the largest number of edges in an $n$-vertex graph containing no copy of $H$. In this paper, we obtain a general upper bound for the extremal number of…
We define an inhomogeneous percolation model on "ladder graphs" obtained as direct products of an arbitrary graph $G = (V,E)$ and the set of integers $\mathbb{Z}$ (vertices are thought of as having a "vertical" component indexed by an…
We define and study a natural category of graph limits. The objects are pairs $(\pi,\mu)$, where $\pi$ (the distribution of vertices) is an abstract probability measure on some abstract measurable space $(X,\mathcal{A})$ and $\mu$ (the…
We investigate a notion of $\times$-homotopy of graph maps that is based on the internal hom associated to the categorical product in the category of graphs. It is shown that graph $\times$-homotopy is characterized by the topological…
Recent works at the interface of algebraic combinatorics, algebraic geometry, number theory, and topology have provided new integer-valued invariants on integer partitions. It is natural to consider the distribution of partitions when…
The singular cubical homology theory for the category of quivers or digraphs can be constructed similarly to the classical singular homology theory for topological spaces. The case of digraphs and quivers differs from the topological case…
The boxicity of a graph is the smallest dimension $d$ allowing a representation of it as the intersection graph of a set of $d$-dimensional axis-parallel boxes. We present a simple general approach to determining the boxicity of a graph…
We define and study a special type of hypergraph. A $\sigma$-hypergraph $H= H(n,r,q$ $\mid$ $\sigma$), where $\sigma$ is a partition of $r$, is an $r$-uniform hypergraph having $nq$ vertices partitioned into $ n$ classes of $q$ vertices…
This paper continues the research of the author on the homology of cubical and semi-cubical sets with coefficients in systems of objects. The main result is the theorem that the homology of cubical sets with coefficients in contravariant…
It is known that all the vector bundles of the title can be obtained by holomorphic induction from representations of a certain parabolic Lie algebra on finite dimensional inner product spaces. The representations, and the induced bundles,…
The aim of this article is to study certain categorical-algebraic frameworks for basic homological algebra, introduced in arXiv:2404.15896, with the aim of better understanding the differences between them. We focus on homological…
We use an extension of the diagrammatic rules in random matrix theory to evaluate spectral properties of finite and infinite products of large complex matrices and large hermitian matrices. The infinite product case allows us to define a…
We continue the development of a so called contextual statistical model (here context has the meaning of a complex of physical conditions). It is shown that, besides contexts producing the conventional trigonometric $\cos$-interference,…
In line with the recent development in topological graph theory, we are considering undirected graphs that are allowed to contain {\em multiple edges}, {\em loops}, and {\em semi-edges}. A graph is called {\em simple} if it contains no…
Let $\mathcal{H}$ be a $t$-regular hypergraph on $n$ vertices and $m$ edges. Let $M$ be the $m \times n$ incidence matrix of $\mathcal{H}$ and let us denote $\lambda =\max_{v \perp \overline{1},\|v\| = 1}\|Mv\|$. We show that the…