Related papers: Gallai-Edmonds Structure Theorem for Weighted Matc…
We prove that a certain sequence of tau functions of the Garnier system satisfies Toda equation. We construct a class of algebraic solutions of the system by the use of Toda equation; then show that the associated tau functions are…
The classic theorem of Gallai and Milgram (1960) generalizes several fundamental results in Graph Theory, such as Dilworth's theorem on posets and K\H{o}nig's theorem on matchings in bipartite graphs. The theorem asserts that for every…
It is known that the complex Grassmannian of $k$-dimensional subspaces can be identified with the set of projection matrices of rank $k$. It is also classically known that the convex hull of this set is the set of Hermitian matrices with…
It is proved that the roots of the derivative of a polynomial with quaternionic coefficients belong to the union of the intersections of sets defined in terms of certain projections of a polynomial. The result strengthens the quaternion…
A new geometry, called General geometry, is constructed. It is proven that its the most simplest special case is geometry underlying Electromagnetism. Another special case is Riemannian geometry. Action for electromagnetic field and Maxwell…
We prove a generalization of Gotzmann's persistence theorem in the case of modules with constant Hilbert polynomial. As a consequence, we show that the defining equations that give the embedding of a Quot scheme of points into a…
We develop a theory of graph algebras over general fields. This is modeled after the theory developed by Freedman, Lov\'asz and Schrijver in [22] for connection matrices, in the study of graph homomorphism functions over real edge weight…
Under certain conditions, we prove that the set of zeros of an elliptic net forms an Abelian group. We present two applications of this fact. Firstly we give a generalization of a theorem of Ayad on valuations of division polynomials in the…
Let X = G/H be a reductive symmetric space and K a maximal compact subgroup of G. The image under the Fourier transform of the space of K-finite compactly supported smooth functions on X is characterized.
Wedderburn's theorem on the structure of finite dimensional semisimple algebras is proved by using minimal prerequisites.
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on the other, is extended to the setting of general planar directed…
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…
We study the perfect matching lattice of a matching covered graph $G$, generated by the incidence vectors of its perfect matchings. Building on results of Lov\'asz and de Carvalho, Lucchesi, and Murty, we give a polynomial-time algorithm…
In the present note we show, via the connection between chromatic polynomial and Potts model, that the Whitney Broken circuit theorem is in fact a special case of a more general identity relating the chromatic polynomial of a graph G=(V,E)…
We show that functorial equivalences can offer new insight into the blockwise Galois Alperin weight conjecture (BGAWC). Inspired by Kn\"orr and Robinson's work, we first formulate the BGAWC in terms of alternating sums indexed by chains of…
We give in the present work a new methodology that allows to give isoperimetric proofs, for Kneser's Theorem and Kemperman's structure Theory and most sophisticated results of this type. As an illustration we present a new proof of Kneser's…
Using connections to random matrix theory and orthogonal polynomials, we develop a framework for obtaining explicit closed-form formulae for the number, $\mathscr{N}_{g}(2\nu,j)$, of connected $2\nu$-valent labeled graphs with $j$ vertices…
The classical Hermite-Biehler theorem describes possible zero sets of complex linear combinations of two real polynomials whose zeros strictly interlace. We provide the full characterization of zero sets for the case when this interlacing…
Let $X$ be an irreducible projective variety and $f$ a morphism $X \rightarrow \mathbb{P}^n$. We give a new proof of the fact that the preimage of any linear variety of dimension $k\ge n+1-\dim f(X)$ is connected. We prove that the…
We review known linear and matrix generalizations of Hall's classic ``marriage theorem'' and K\H{o}nig's theorem on partial matchings in bipartite graphs, and relate them to linear and matrix generalizations of Dilworth's theorem about…