Related papers: On Maximal and Minimal Linear Matching Property
A new proof for adjoint systems of linear equations is presented. The argument is built on the principles of Algorithmic Differentiation. Application to scalar multiplication sets the base line. Generalization yields adjoint inner vector,…
We study the algebraic closure of $\mathbb K(\!(x)\!)$, the field of power series in several indeterminates over a field $\mathbb K$. In characteristic zero we show that the elements algebraic over $\mathbb K(\!(x)\!)$ can be expressed as…
A connected graph $G$ with at least $2m+2n+2$ vertices is said to have property $E(m,n)$ if, for any two disjoint matchings $M$ and $N$ of size $m$ and $n$ respectively, $G$ has a perfect matching $F$ such that $M\subseteq F$ and $N\cap…
The purpose of this note is to give a number of open problems on matching theory and their relation to the well-known results in this area. We also give a linear analogue of the acyclic matchings.
In this article, we present a characterization of the concavity property of minimal $L^2$ integrals degenerating to linearity in the case of finite points on open Riemann surfaces. As an application, we give a characterization of the…
It is well known that a purely inseparable field extension $L/F$ with some extra property and degree $[L:F]=4$ determines a Clifford parallelism on the set of lines of the three-dimensional projective space over $F$. By extending the ground…
Perfect matching width is a treewidth-like parameter designed for graphs with perfect matchings. The concept was originally introduced by Norine for the study of non-bipartite Pfaffian graphs. Additionally, perfect matching width appears to…
As shown in a previous paper, whenever a rational vector field on $\mathbb C^n$, $n>2$, is Liouvillian integrable, then it admits a first integral obtained by two successive integrations from a one-form with coefficients in a finite…
We study the question of algebraic rank or transcendence degree preserving homomorphisms over finite fields. This concept was first introduced by Beecken, Mittmann and Saxena (2013), and exploited by them, and Agrawal, Saha, Saptharishi and…
We study noncrossing geometric graphs and their disjoint compatible geometric matchings. Given a cycle (a polygon) P we want to draw a set of pairwise disjoint straight-line edges with endpoints on the vertices of P such that these new…
In graph theory there are intimate connections between the expansion properties of a graph and the spectrum of its Laplacian. In this paper we define a notion of combinatorial expansion for simplicial complexes of general dimension, and…
In the theory of complete Pick spaces, the column-row property has appeared in a variety of contexts. We show that it is satisfied by every complete Pick space in the following strong form: each sequence of multipliers that induces a…
We prove the sufficiency of the Linear Superposition Principle for linear trees, which characterizes the spectra achievable by a real symmetric matrix whose underlying graph is a linear tree. The necessity was previously proven in 2014.…
We characterize completey (give a necessary and suffcient condition using special neat embeddings)for a relation algebra to belong to the amalgamation, strong amalgamation, and superamalgamation base of the class of representable algebras.…
A popular method in combinatorial optimization is to express polytopes P, which may potentially have exponentially many facets, as solutions of linear programs that use few extra variables to reduce the number of constraints down to a…
We classify the algebraic combinatorial geometries of arbitrary field extensions of transcendence degree greater than 4 and describe their groups of automorphisms. Our results and proofs extend similar results and proofs by Evans and…
Let $\mathbb{K}$ be a function field of characteristic $p>0$. We recently established the analogue of a theorem of Ku. Nishioka for linear Mahler systems defined over $\mathbb{K}(z)$. This paper is dedicated to proving the following…
In the seminal book M\'echanique analitique, Lagrange, 1788, the notion of a Lagrange multiplier was first introduced in order to study a smooth minimization problem subject to equality constraints. The idea is that, under some regularity…
Let $\mathcal{A}$ and $\mathcal{B}$ be unital finite-dimensional complex algebras, each equipped with the unique Hausdorff vector topology. Denote by $\mathrm{Max}(\mathcal{A})=\{\mathcal{M}_1, \ldots, \mathcal{M}_p\}$ and…
We introduce the homogeneous and piecewise multilinear extensions and the eigenvalue problem for locally Lipschitz function pairs, in order to develop a systematic framework for relating discrete and continuous min-max problems. This also…