Related papers: Reduced decompositions and commutation classes
We present time-efficient distributed algorithms for decomposing graphs with large edge or vertex connectivity into multiple spanning or dominating trees, respectively. As their primary applications, these decompositions allow us to achieve…
The problem of finding graph structure of functions commuting with a given function in terms of their functional graphs is considered. Structure of functional graphs of commuting functions is described. The problem is reduced to describing…
Given a row-finite, source-free, graph of rank k, we extend the definition of reduction introduced by Eckhardt et al. This constitutes a large step forward in the extension of the geometric classification of finite directed graph…
The theory of graphons is ultimately connected with the so-called cut norm. In this paper, we approach the cut norm topology via the weak* topology (when considering a predual of $L^{1}$-functions). We prove that a sequence…
A tensor network is a product of tensors associated with vertices of some graph $G$ such that every edge of $G$ represents a summation (contraction) over a matching pair of indexes. It was shown recently by Valiant, Cai, and Choudhary that…
In this work we attempt to generalize our result in [6] [7] for real rings (not just von Neumann regular real rings). In other words we attempt to characterize and construct real closure * of commutative unitary rings that are real. We also…
We adapt the work of Power to describe general, not-necessarily composable, not-necessarily commutative 2-categorical pasting diagrams and their composable and commutative parts. We provide a deformation theory for pasting diagrams valued…
We give an approach for relative and degenerate Gromov--Witten invariants, inspired by that of Jun Li but replacing predeformable maps by transversal maps to a twisted target. The main advantage is a significant simplification in the…
We study a class of representations of the Cuntz algebras O_N, N=2,3,..., acting on L^2(T) where T=R/2\pi Z. The representations arise in wavelet theory, but are of independent interest. We find and describe the decomposition into…
We develop the deformation theory of cohomological field theories (CohFTs), which is done as a special case of a general deformation theory of morphisms of modular operads. This leads us to introduce two new natural extensions of the notion…
We study the following version of cut sparsification. Given a large edge-weighted network $G$ with $k$ terminal vertices, compress it into a smaller network $H$ with the same terminals, such that every minimum terminal cut in $H$…
In the past two decades, various properties of randomly perturbed/augmented (hyper)graphs have been intensively studied, since the model was introduced by Bohman, Frieze and Martin in 2003. The model usually considers a deterministic graph…
We prove a conjecture of Reiner, Tenner, and Yong which says that the initial weak order intervals corresponding to certain vexillary permutations have the coincidental down-degree expectations (CDE) property. Actually our theorem applies…
Forbidden characterizations may sometimes be the most natural way to describe families of graphs, and yet these characterizations are usually very hard to exploit for enumerative purposes. By building on the work of Gioan and Paul (2012)…
This paper proposes a novel representation of decomposable graphs based on semi-latent tree-dependent bipartite graphs. The novel representation has two main benefits. First, it enables a form of sub-clustering within maximal cliques of the…
A tuple (Z_1,...,Z_p) of matrices of size r is said to be a commuting extension of a tuple (A_1,...,A_p) of matrices of size n <r if the Z_i pairwise commute and each A_i sits in the upper left corner of a block decomposition of Z_i. This…
Tensor network decompositions offer an efficient description of certain many-body states of a lattice system and are the basis of a wealth of numerical simulation algorithms. We discuss how to incorporate a global symmetry, given by a…
Modern neural networks have revolutionized the fields of computer vision (CV) and Natural Language Processing (NLP). They are widely used for solving complex CV tasks and NLP tasks such as image classification, image generation, and machine…
In this paper we give a bijection between the class of permutations that can be drawn on an X-shape and a certain set of permutations that appears in [Knuth] in connection to sorting algorithms. A natural generalization of this set leads us…
Let $G$ be a $p$-group. We begin to consider the relationship between the structure of the commuting graph and $|G:Z(G)|$. We also build a family of groups whose commuting graphs have more than one connected component whose diameter is at…