Related papers: The core of a Grassmannian frame
The contact graph of a packing of translates of a convex body in Euclidean $d$-space $\mathbb E^d$ is the simple graph whose vertices are the members of the packing, and whose two vertices are connected by an edge if the two members touch…
Denote by PSelf(X) (resp., Self(X)) the partial (resp., full) transformation monoid over a set X, and by Sub(V) (resp., End(V)) the collection of all subspaces (resp., endomorphisms) of a vector space V. We prove various results that imply…
In network analysis, a measure of node centrality provides a scale indicating how central a node is within a network. The coreness is a popular notion of centrality that accounts for the maximal smallest degree of a subgraph containing a…
Let X be a smooth projective curve over a field k of characteristic zero. The differential fundamental group of X is defined as the Tannakian dual to the category of vector bundles with (integrable) connections on X. This work investigates…
A separable covariance model for a random matrix provides a parsimonious description of the covariances among the rows and among the columns of the matrix, and permits likelihood-based inference with a very small sample size. However, in…
We study algebraic integrability of complex planar polynomial vector fields $X=A (x,y)(\partial/\partial x) + B(x,y) (\partial/\partial y) $ through extensions to Hirzebruch surfaces. Using these extensions, each vector field $X$ determines…
Let $n$ be any positive integer, the friendship graph $F_n$ consist of $n$ edge-disjoint triangles that all of them meeting in one vertex. A graph $G$ is called cospectral with a graph $H$ if their adjacency matrices have the same…
We study kernelization (a kind of efficient preprocessing) for NP-hard problems on planar graphs. Our main result is a kernel of size at most 9k vertices for the Planar Maximum Nonseparating Independent Set problem. A direct consequence of…
Let I be an m-primary ideal of a Noetherian local ring (R,m). We consider the Gorenstein and complete intersection properties of the associated graded ring G(I) and the fiber cone F(I) of I as reflected in their defining ideals as…
A graph is $\textit{cubelike}$ if it is a Cayley graph for some elementary abelian $2$-group $\mathbb{Z}_2^n$. The core of a graph is its smallest subgraph to which it admits a homomorphism. More than ten years ago, Ne\v{s}et\v{r}il and…
In this paper, our goal is to characterize two graph classes based on the properties of minimal vertex (edge) separators. We first present a structural characterization of graphs in which every minimal vertex separator is a stable set. We…
A mixed graph $G$ is a graph obtained from a simple undirected graph by orientating a subset of edges. $G$ is self-converse if it is isomorphic to the graph obtained from $G$ by reversing each directed edge. For two mixed graphs $G$ and $H$…
A planar graph is inscribable if it is combinatorial equivalent to the skeleton of a polyhedra which is inscribed in a sphere. For an inscribable graph, in its combinatorial equivalent class, if we could always find polyhedra inscribed in…
A collection of vectors in a real vector space is called a unimodular system if any of its maximal linearly independent subsets generates the same free abelian group. This notion is closely connected with totally unimodular matrices: rows…
We consider a special type of Restricted Boltzmann machine (RBM), namely a Gaussian-spherical RBM where the visible units have Gaussian priors while the vector of hidden variables is constrained to stay on an ${\mathbbm L}_2$ sphere. The…
This work results from a study of Nicholas Kuhn's paper entitled "Generic representation theory of finite fields in nondescribing characteristic". Our goal is to abstract the categorical structure required to obtain an equivalence between…
A copy of a graph $F$ is called an $F$-copy. For any graph $G$, the $F$-isolation number of $G$, denoted by $\iota(G,F)$, is the size of a smallest subset $D$ of the vertex set of $G$ such that the closed neighbourhood $N[D]$ of $D$ in $G$…
Correlation matrices are fundamental summaries of functional brain networks, yet standard analyses often treat entries independently, ignoring the curved geometry of correlation space. Existing geometric methods frequently lack closed-form…
We find formulas for the graded core of certain m-primary ideals in a graded ring. In particular, if S is the section ring of an ample line bundle on a Cohen-Macaulay complex projective variety, we show that under suitable hypothesis, the…
Let $Gr(k,n)$ be the Pl\"ucker embedding of the Grassmann variety of projective $k$-planes in $\P n$. For a projective variety $X$, let $\sigma_s(X)$ denote the variety of its $s-1$ secant planes. More precisely, $\sigma_s(X)$ denotes the…