相关论文: Spectral gap characterization of full type III fac…
A graph is {\em perfect} if, in all its induced subgraphs, the size of a largest clique is equal to the chromatic number. Examples of perfect graphs include bipartite graphs, line graphs of bipartite graphs and the complements of such…
It is known that the eigenvalues of selfadjoint elements a,b,c with a+b+c=0 in the factor R^omega (ultrapower of the hyperfinite II1 factor) are characterized by a system of inequalities analogous to the classical Horn inequalities of…
For convex and sequential effect algebras, we study spectrality in the sense of Foulis. We show that under additional conditions (strong archimedeanity, closedness in norm and a certain monotonicity property of the sequential product), such…
Let $G$ be a graph with vertex set $V(G)$ and let $H:V(G)\rightarrow 2^N$ be a set function associating with $G$. An $H$-factor of graph $G$ is a spanning subgraphs $F$ such that $$d_F(v)\in H(v){4em}\hbox{for every}v\in V(G).$$ Let…
Let G be an undirected simple graph having n vertices and let f be a function defined to be f:V(G) -> {0,..., n-1}. An f-factor of G is a spanning subgraph H such that degree of a vertex v in H is f(v) for every vertex v in V(G). The…
A graph $G$ is well-covered if all maximal independent sets of $G$ have the same cardinality. In 1992 Topp and Volkmann investigated the structure of well-covered graphs that have nontrivial factorizations with respect to some of the…
We give a criterion for a nef divisor $D$ to be semiample on a Calabi--Yau threefold $X$ when $D^3=0=c_2(X)\cdot D$ and $c_3(X)\neq 0$. As a direct consequence, we show that on such a variety $X$, if $D$ is strictly nef and $\nu(D)\neq 1$,…
The infinitesimal symmetry algebra of any Cartan geometry has maximum dimension realized by the flat model, but often this dimension drops significantly when considering non-flat geometries, so a gap phenomenon arises. For general (regular,…
We canonically associate to any planar algebra two type II_{\infty} factors M_{+} and M_{-}. The subfactors constructed previously by the authors in a previous paper are isomorphic to compressions of M_{+} and M_{-} to finite projections.…
A few years ago, Richard Kadison thoroughly analysed the diagonals of projection operators on Hilbert spaces and asked the following question: Let $\mathcal{A}$ be a masa in a type $II_1$ factor $\mathcal{M}$ and let $A \in \mathcal{A}$ be…
Flat connections for unitary gauge groups on a 3--torus with twisted boundary conditions as well as recently discovered periodic nontrivial flat connections with ``nondiagonalizable'' triples of holonomies for higher orthogonal and…
We give an explicit and calculable algebraic model for the block of rational G-spectra on full subgroups when G has identity component a 2-torus T, and component group of order 2 acting non-trivially on H_1(T). The example of particular…
Let $G=(V(G), E(G))$ be a graph with vertex set $V(G)$ and edge set $E(G)$. A graph is $ID$-factor-critical if for every independent set $I$ of $G$ whose size has the same parity as $|V(G)|$, $G-I$ has a perfect matching. For two positive…
For a graph $G = (V, E)$, a {\em fractional $[a, b]$-factor} is a real valued function $h:E(G)\to [0,1]$ that satisfies $a \le ~ \sum_{e\in E_G(v)} h(e) ~ \le b$ for all $ v\in V(G)$, where $a$ and $b$ are real numbers and $E_G(v)$ denotes…
Let $X$ be a connected, smooth, and projective curve of genus $g$ over an algebraically closed field of characteristic $p >0$. This paper investigates a characteristic-$p$ analogue of a well-known fact concerning flat vector bundles in…
We study a combinatorial property of subsets in finite groups that is analogous to the notion of independence in graphs. Given a group $G$ and a non-empty subset $A\subset G$, we define a (right) $s$-factor as a subset $B\subset G$…
We give a subfactor construction for a $II_{1}$ factor M which is not anti-isomorphic to itself. The $II_{1}$ factor we consider is essentially the same as the example previously given by Connes. However, our construction uses the recently…
Let K(S) be the subgroup of the extended mapping class group, Mod(S), generated by Dehn twists about separating curves. In our earlier paper, we showed that Comm(K(S)) and Aut(K(S)) are both isomorphic to Mod(S) when S is a closed,…
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…
A $k$-regular spanning subgraph of $G$ is called a $k$-factor. Fan, Lin and Lu [European J. Combin. 110 (2023) 103701] presented a tight sufficient condition in terms of the spectral radius for a connected 1-tough graph to contain a…