Related papers: Block structure in boolean matrices of bounded fac…
In this article we introduce $K$-type block matrices which include two new classes of block matrices namely block triangular $K$-matrices and hidden block triangular $K$-matrices. We show that the solution of linear complementarity problem…
We consider large-$c$ $n$-point Virasoro blocks with $n-k$ background heavy operators and $k$ perturbative heavy operators. Conformal dimensions of heavy operators scale linearly with large $c$, while splitting into background/perturbative…
Sparse matrix factorization is the problem of approximating a matrix $\mathbf{Z}$ by a product of $J$ sparse factors $\mathbf{X}^{(J)} \mathbf{X}^{(J-1)} \ldots \mathbf{X}^{(1)}$. This paper focuses on identifiability issues that appear in…
Statistical inference for stochastic block models typically relies on the spectrum of the normalized adjacency matrix $\A^*$. In practice, the true probability matrix $\mathbf{B}$ is unknown and must be replaced by a plug-in estimator…
We will start from the beginning and define a matroid and its Orlik-Solomon algebra and holonomy Lie algebra, but first we give some background from topology and cohomology. A (central) hyperplane arrangement is a finite number of subspaces…
Motivated by complexity questions in integer programming, this paper aims to contribute to the understanding of combinatorial properties of integer matrices of row rank $r$ and with bounded subdeterminants. In particular, we study the…
We investigate how classifiers for Boolean networks (BNs) can be constructed and modified under constraints. A typical constraint is to observe only states in attractors or even more specifically steady states of BNs. Steady states of BNs…
We propose a specific class of matrices which participate in factorization problems that turn to be equivalent to constant and entwining (non-constant) pentagon, reverse-pentagon or Yang-Baxter maps, expressed in non-commutative variables.…
We investigate random connected graphs from a block-stable class whose distribution is weighted based on the number of $2$-connected components, or blocks. This includes the class of planar graphs. For this, we develop a notion of a…
We prove that if the prime graphs in a graph class have bounded lettericity, then the entire class has bounded lettericity if and only if it does not contain arbitrary large matchings, co-matchings, or a family of graphs that we call…
Identifying discrete patterns in binary data is an important dimensionality reduction tool in machine learning and data mining. In this paper, we consider the problem of low-rank binary matrix factorisation (BMF) under Boolean arithmetic.…
An algebraic structure with two constants and one ternary operation, which is not completely commutative, is put forward to accommodate ternary Boolean algebras. When the ternary operation is interpreted as Church's conditioned disjunction,…
In this work, we characterize matrices of linear forms and constant rank, demonstrating that, under some natural assumptions, they are always associated with a syzygy bundle that fits into a (partially linear) resolution. Furthermore, this…
The paper presents several approaches to generalized blockmodeling of valued networks, where values of the ties are assumed to be measured on at least interval scale. The first approach is a straightforward generalization of the generalized…
We define the block neighborhood of a reversible CA, which is related both to its decomposition into a product of block permutations and to quantum computing. We give a purely combinatorial characterization of the block neighborhood, which…
We consider in general two-block substitutions and their fixed points. We prove that some of them have a simple structure: their fixed points are morphic sequences. Others are intrinsically more complex, such as the Kolakoski sequence. We…
We are interested in the phenomenon of the essential spectrum instability for a class of unbounded (block) Jacobi matrices. We give a series of sufficient conditions for the matrices from certain classes to have a discrete spectrum on a…
Networks are a commonly used mathematical model to describe the rich set of interactions between objects of interest. Many clustering methods have been developed in order to partition such structures, among which several rely on underlying…
A digraph D is the pattern of a matrix M when D has an arc ij if and only if the ij-th entry of M is nonzero. Study the relationship between unitary matrices and their patterns is motivated by works in quantum chaology and quantum…
A combinatorial code $\mathcal{C}$ is a collection of subsets of $[n]$, or equivalently a set of points in $\{0,1\}^n$. A morphism of codes is a map from one combinatorial code to another such that the coordinates of points in the image can…