Related papers: A note on uniquely embeddable 2-factors

In previous work, we defined the category of functors Fquad, associated to vector spaces over the field with two elements equipped with a nondegenerate quadratic form. In this paper, we define a special family of objects in the category…

We recall several known results about minimally 2-connected graphs, and show that they all follow from a decomposition theorem. Starting from an analogy with critically 2-connected graphs, we give structural characterizations of the classes…

In a graph whose vertices are assigned integer ranks, a path is well-ranked if the endpoints have distinct ranks or some interior point has a higher rank than the endpoints. A ranking is an assignment of ranks such that all nontrivial paths…

For any finite dimensional C^*-algebra A with a trace vector \vec s whose entries are rational numbers, we give an endomorphism \Phi of the hyperfinite II_1 factor R such that: for all k \in \mathbb {N}, \Phi^k (R)' \cap R= \otimes^k A. The…

We conjecture that a 2-connected graph $G$ of order $n$, in which $d(x)+d(y)\geq n-k$ for every pair of non-adjacent vertices $x$ and $y$, contains a cycle of length $n-k$ ($k<n/2$), unless $G$ is bipartite and $n-k$ is odd. This…

Let $k$ be a positive integer. Let $G$ be a balanced bipartite graph of order $2n$ with bipartition $(X, Y)$, and $S$ a subset of $X$. Suppose that every pair of nonadjacent vertices $(x,y)$ with $x\in S, y\in Y$ satisfies $d(x)+d(y)\geq…

A group is called capable if it is a central factor group. We consider the capability of finite groups of class two and exponent $p$, $p$ an odd prime. We restate the problem of capability as a problem about linear transformations, which…

We show that the finite simply connected 2-complexes of nonpositive planar sectional curvature are collapsible. Moreover, we show that each finite connected 2-complex with negative planar sectional curvature and fundamental group…

In this paper we give explicit characterizations, based on the cutting and spacer parameters, of (a) which rank-one transformations factor onto a given finite cyclic permutation, (b) which rank-one transformations factor onto a given…

Every mathematician is familiar with the beautiful structure of finite commutative groups. What is less well known is that finite commutative semigroups also have a neat and well-described structure. We prove this in an efficient fashion.…

We consider the determination of the number $c_k(\alpha)$ of ordered factorisations of an arbitrary permutation on n symbols, with cycle distribution $\alpha$, into k-cycles such that the factorisations have minimal length and such that the…

An account of 2-factors in graphs and their history is presented. We give a direct graph-theoretic proof of the 2-Factor Theorem and a new variant of it, and also a new complete characterisation of the maximal graphs without 2-factors. This…

We study a counting version of Cycle Double Cover Conjecture. We discuss why it is more interesting to count circuits (i.e., graphs isomorphic to $C_k$ for some $k$) instead of cycles (graphs with all degrees even). We give an…

We consider a set of cliques in any multipartite graph with two vertices in each part. Moreover, we construct a class of peculiar polytopes. Key words: multipartite graph, clique, polytope.

We describe a procedure to construct infinite sets of pairwise smoothly inequivalent 2-spheres in simply connected 4-manifolds, which are topologically isotopic and whose complement has a prescribed fundamental group that satisfies some…

In the paper, we study the generator problem of II$_1$ factors. By defining a new concept related to the number of generators of a von Neumann algebra, we are able to show that a large class of II$_1$ factors are singly generated, i.e.,…

An alternative foundation for 2-categories is explored by studying graph-theoretically a partial operation on 2-cells named juncture, which can replace vertical and horizontal composition. Juncture is a generalized vertical composition of…

In this paper, we present a family of bivariate copulas by transforming a given copula function with two increasing functions, named as transformed copula. One distinctive characteristic of the transformed copula is its singular component…

We provide a complete classification of the singularities of cluster algebras of finite cluster type. This extends our previous work about the case of trivial coefficients. Additionally, we classify the singularities of cluster algebras for…

Let $\mathfrak{C}$ be a multifusion 2-category. We show that every finite semisimple $\mathfrak{C}$-module 2-category is canonically enriched over $\mathfrak{C}$. Using this enrichment, we prove that every finite semisimple…