Related papers: Gallai-Edmonds Structure Theorem for Weighted Matc…
We discuss as a fundamental characteristic of orthogonal polynomials like the existence of a Lie algebra behind them, can be added to their other relevant aspects. At the basis of the complete framework for orthogonal polynomials we put…
We present the first formal correctness proof of Edmonds' blossom shrinking algorithm for maximum cardinality matching in general graphs. We focus on formalising the mathematical structures and properties that allow the algorithm to run in…
We provide a structure theorem for all almost complete intersection ideals of depth three in any Noetherian local ring. In particular, we find that the minimal generators are the pfaffians of suitable submatrices of an alternating matrix.…
A $(1+1)$ dimensional model where vector and axial vector interaction get mixed up with different weight is considered with a generalized masslike term for gauge field. Through Poincar\'e algebra it has been made confirm that only a Lorentz…
This paper investigates the interplay between local and global equivalences on noncommutative polynomials, the elements of the free algebra. When the latter are viewed as functions in several matrix variables, a local equivalence of…
An element [\Phi] of the Grassmannian of n-dimensional subspaces of the Hardy space H^2, extended over the field C(x_1,..., x_n), may be associated to any polynomial basis {\phi} for C(x). The Pl\"ucker coordinates…
We analyze a new spectral graph matching algorithm, GRAph Matching by Pairwise eigen-Alignments (GRAMPA), for recovering the latent vertex correspondence between two unlabeled, edge-correlated weighted graphs. Extending the exact recovery…
We take a unifying and new approach toward polynomial and trigonometric approximation in an arbitrary number of variables, resulting in a precise and general ready-to-use tool that anyone can easily apply in new situations of interest. The…
We study Betti structures in the solution complexes of confluent hypergeometric equations. We use the framework of enhanced ind-sheaves and the irregular Riemann-Hilbert correspondence of D'Agnolo-Kashiwara. The main result is a group…
Given a level set $E$ of an arbitrary multiplicative function $f$, we establish, by building on the fundamental work of Frantzikinakis and Host [13,14], a structure theorem which gives a decomposition of $\mathbb{1}_E$ into an almost…
Using Dwork's theory, we prove a broad generalisation of his famous p-adic formal congruences theorem. This enables us to prove certain p-adic congruences for the generalized hypergeometric series with rational parameters; in particular,…
Recently Takens' Reconstruction Theorem was studied in the complex analytic setting by Forn{\ae}ss and Peters \cite{FP}. They studied the real orbits of complex polynomials, and proved that for non-exceptional polynomials ergodic properties…
The space of polynomials in two real variables with values in a 2-dimensional irreducible module of a dihedral group is studied as a standard module for Dunkl operators. The one-parameter case is considered (omitting the two-parameter case…
In this paper motivated by the celebrated fundamental theorem of algebra and its standard proof utilizing Liouville's Theorem, we prove the fundamental theorem of algebra type results for both commutative and noncommutative polynomials in…
Let G=GL_n be the general linear group over an algebraically closed field k and let g=gl_n be its Lie algebra. Let U be the subgroup of G which consists of the upper unitriangular matrices. Let k[g] be the algebra of polynomial functions on…
The classical Matrix-Tree Theorem allows one to list the spanning trees of a graph by monomials in the expansion of the determinant of a certain matrix. We prove that in the case of three-graphs (that is, hypergraphs whose edges have…
We show that every complete intersection of Laurent polynomials in an algebraic torus is isomorphic to a complete intersection of master functions in the complement of a hyperplane arrangement, and vice versa. We call this association Gale…
This paper puts forward a new generalized polynomial dimensional decomposition (PDD), referred to as GPDD, comprising hierarchically ordered measure-consistent multivariate orthogonal polynomials in dependent random variables. Unlike the…
We generalize two main theorems of matching polynomials of undirected simple graphs, namely, real-rootedness and the Heilmann-Lieb root bound. Viewing the matching polynomial of a graph $G$ as the independence polynomial of the line graph…
Paley-Wiener type theorems describe the image of a given space of functions, often compactly supported functions, under an integral transform, usually a Fourier transform on a group or homogeneous space. Several authors have studied…