Related papers: Constructive Characterization of Critical Bipartit…
The study of entrywise powers of matrices was originated by Loewner in the pursuit of the Bieberbach conjecture. Since the work of FitzGerald and Horn (1977), it is known that $A^{\circ \alpha} := (a_{ij}^\alpha)$ is positive semidefinite…
We give an atomic decomposition of closed forms on R n , the coefficients of which belong to some Hardy space of Musielak-Orlicz type. These spaces are natural generalizations of weighted Hardy-Orlicz spaces, when the Orlicz function…
We develop a saddle-point theory for acyclic orientations and negative chromatic evaluations of complete multipartite graphs, with applications to OEIS A267383, A372326, A372084, A372395, and A370613. The main tool is an exact Gamma-type…
Feature extraction and dimension reduction for networks is critical in a wide variety of domains. Efficiently and accurately learning features for multiple graphs has important applications in statistical inference on graphs. We propose a…
There is recent interest in compressing data sets for non-sequential settings, where lack of obvious orderings on their data space, require notions of data equivalences to be considered. For example, Varshney & Goyal (DCC, 2006) considered…
We study the existence of perfect matchings in suitably chosen induced subgraphs of random biregular bipartite graphs. We prove a result similar to a classical theorem of Erdos and Renyi about perfect matchings in random bipartite graphs.…
Functional decomposition of logic circuits has profound influence on all quality aspects of the cost-effective implementation of modern digital systems. In this paper, a relational approach to the decomposition of logic circuits is…
Donald and Owens introduced two link concordance groups with a marked component and showed that they contain the knot concordance group as a direct summand with infinitely generated complements. While not explicitly posed by Donald and…
This paper provides short proofs of two fundamental theorems of finite semigroup theory whose previous proofs were significantly longer, namely the two-sided Krohn-Rhodes decomposition theorem and Henckell's aperiodic pointlike theorem,…
Knowledge graph is a popular format for representing knowledge, with many applications to semantic search engines, question-answering systems, and recommender systems. Real-world knowledge graphs are usually incomplete, so knowledge graph…
General semifinite factor representations of the diffeomorphism group of euclidean space are constructed by means of a canonical correspondence with the finite factor representations of the inductive limit unitary group. This construction…
A {\it star-factor} of a graph $G$ is a spanning subgraph of $G$ such that each of its component is a star. Clearly, every graph without isolated vertices has a star factor. A graph $G$ is called {\it star-uniform} if all star-factors of…
Counting the number of all the matchings on a bipartite graph has been transformed into calculating the permanent of a matrix obtained from the extended bipartite graph by Yan Huo, and Rasmussen presents a simple approach (RM) to…
Counting the number of all the matchings on a bipartite graph has been transformed into calculating the permanent of a matrix obtained from the extended bipartite graph by Yan Huo, and Rasmussen presents a simple approach (RM) to…
We study the approximate maximum weight matching (MWM) problem in a fully dynamic graph subject to edge insertions and deletions. We design meta-algorithms that reduce the problem to the unweighted approximate maximum cardinality matching…
Assume that there is a free group action of automorphisms on a bipartite graph. If there is a perfect matching on the factor graph, then obviously there is a perfect matching on the graph. Surprisingly, the reversed is also true for…
Several graph decompositions that factorize the determinant of the adjacency matrix isolate a K\H{o}nig-Egerv\'ary part, such as the SD--KE decomposition and the critical independence decomposition of Larson. This suggests that the study of…
The problem of characterizing maximal non-Hamiltonian graphs may be naturally extended to characterizing graphs that are maximal with respect to non-traceability and beyond that to $t$-path traceability. We show how traceability behaves…
We consider the deformations of ``monomial solutions'' to Generalized Kontsevich Model \cite{KMMMZ91a,KMMMZ91b} and establish the relation between the flows generated by these deformations with those of $N=2$ Landau-Ginzburg topological…
A graph is pseudo 2-factor isomorphic if all of its 2-factors have the same parity of number of cycles. Abreu et al. [J. Comb. Theory, Ser. B. 98 (2008) 432--442] conjectured that $K_{3,3}$, the Heawood graph and the Pappus graph are the…