Related papers: The core of a Grassmannian frame

The core of an $R$-ideal $I$ is the intersection of all reductions of $I$. This object was introduced by D. Rees and J. Sally and later studied by C. Huneke and I. Swanson, who showed in particular its connection to J. Lipman's notion of…

A vector field similar to those separately introduced by Artstein and Dafermos is constructed from the tangent to a monotone increasing one-parameter family of non-concentric circles that touch at the common point of intersection taken as…

Let v_1,...,v_{n-1} be n-1 independent vectors in R^n (or C^n). We study x, the unit normal vector of the hyperplane spanned by the v_i. Our main finding is that x resembles a random vector chosen uniformly from the unit sphere, under some…

Unless another thing is stated one works in the $C^\infty$ category and manifolds have empty boundary. Let $X$ and $Y$ be vector fields on a manifold $M$. We say that $Y$ tracks $X$ if $[Y,X]=fX$ for some continuous function $f\colon…

We call a (simple) graph G codismantlable if either it has no edges or else it has a codominated vertex x, meaning that the closed neighborhood of x contains that of one of its neighbor, such that G-x codismantlable. We prove that if G is…

A concentration graph associated with a random vector is an undirected graph where each vertex corresponds to one random variable in the vector. The absence of an edge between any pair of vertices (or variables) is equivalent to full…

A dominating set of a graph $G$ is a subset $S$ of its vertices such that each vertex of $G$ not in $S$ has a neighbor in $S$. A face-hitting set of a plane graph $G$ is a set $T$ of vertices in $G$ such that every face of $G$ contains at…

This paper is an introduction to polarizations in the symplectic and orthogonal settings. They arise in association to a triple of compatible structures on a real vector space, consisting of an inner product, a symplectic form, and a…

Let $X$ be a smooth projective variety of dimension $n$ over an algebraically closed field $k$ with ${\rm char}(k)=p>0$ and $F:X\to X_1$ be the relative Frobenius morphism. For any vector bundle $W$ on $X$, we prove that instability of…

In this paper, we extend original Neural Collapse Phenomenon by proving Generalized Neural Collapse hypothesis. We obtain Grassmannian Frame structure from the optimization and generalization of classification. This structure maximally…

An independent set in a graph is a set of pairwise non-adjacent vertices, and alpha(G) is the size of a maximum independent set in the graph G. A matching is a set of non-incident edges, while mu(G) is the cardinality of a maximum matching.…

We investigate vector contributions to the Lagrangian of $\Lambda_3-$massive gravity in the decoupling limit, the less explored sector of this theory. The main purpose is to understand the stability of maximally symmetric %self-accelerating…

We give a notion of "combinatorial proximity" among strongly stable ideals in a given polynomial ring with a fixed Hilbert polynomial. We show that this notion guarantees "geometric proximity" of the corresponding points in the Hilbert…

Let L be any number field or $\mathfrak{p}$-adic field and consider F:=(f_1,...,f_k) where f_i is in L[x_1,...,x_n]\{0} for all i and there are exactly m distinct exponent vectors appearing in f_1,...,f_k. We prove that F has no more than…

Let $\mathbb{F}_q$ denote a finite field with $q$ elements. Let $n,k$ denote integers with $n>2k\geq 6$. Let $V$ denote a vector space over $\mathbb{F}_{q}$ that has dimension $n$. The vertex set of the Grassmann graph $J_q(n,k)$ consists…

We consider relations with no order on their attributes as in Database Theory. An independent partition of the set of attributes S of a finite relation R is any partition X of S such that the join of the projections of R over the elements…

Let $Gr$ be a component of the Grassmann manifold of a $C^*$-algebra, presented as the unitary orbit of a given orthogonal projection $Gr=Gr(P)$. There are several natural connections in this manifold, and we first show that they all agree…

We determine the maximum number of edges of an $n$-vertex graph $G$ with the property that none of its $r$-cliques intersects a fixed set $M\subset V(G)$. For $(r-1)|M|\ge n$, the $(r-1)$-partite Turan graph turns out to be the unique…

The Grassmannian of affine subspaces is a natural generalization of both the Euclidean space, points being zero-dimensional affine subspaces, and the usual Grassmannian, linear subspaces being special cases of affine subspaces. We show…

Riemann's non-differentiable function is a classic example of a continuous function which is almost nowhere differentiable, and many results concerning its analytic regularity have been shown so far. However, it can also be given a…