Related papers: On Maximal and Minimal Linear Matching Property
We study property A for metric spaces $X$ with bounded geometry introduced by Guoliang Yu. Property A is an amenability-type condition, which is less restrictive than amenability for groups. The property has a connection with…
One of my recent papers transforms an NP-Complete problem into the question of whether or not a feasible real solution exists to some Linear Program. The unique feature of this Linear Program is that though there is no explicit bound on the…
The \emph{matching preclusion number} of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings. As a generalization, Liu and Liu recently introduced the…
As a special class of linear codes, minimal linear codes have important applications in secret sharing and secure two-party computation. Constructing minimal linear codes with new and desirable parameters has been an interesting research…
In this note a natural strengthening of internality motivated by complex geometry, being "Moishezon" to a set of types, is introduced. Under the hypothesis of Pillay's canonical base property, and using results of Chatzidakis, a criterion…
We formulate and prove matroid analogues of results concerning matchings in groups. A matching in an abelian group $(G,+)$ is a bijection $f:A\to B$ between two finite subsets $A,B$ of $G$ satisfying $a+f(a)\notin A$ for all $a\in A$. A…
Let $G$ be a connected unimodular group equipped with a (left and hence right) Haar measure $\mu_G$, and suppose $A, B \subseteq G$ are nonempty and compact. An inequality by Kemperman gives us…
We study the computational complexity of several problems connected with finding a maximal distance-$k$ matching of minimum cardinality or minimum weight in a given graph. We introduce the class of $k$-equimatchable graphs which is an edge…
In 1979, Nishizeki and Baybars showed that every planar graph with minimum degree 3 has a matching of size $\frac{n}{3}+c$ (where the constant $c$ depends on the connectivity), and even better bounds hold for planar graphs with minimum…
We present a recursive minimal polynomial theorem for finite sequences over a commutative integral domain $D$. This theorem is relative to any element of $D$. The ingredients are: the arithmetic of Laurent polynomials over $D$, a recursive…
We construct elliptic extensions of the alpha-parameter rook model introduced by Goldman and Haglund and of the rook model for matchings of Haglund and Remmel. In particular, we extend the product formulas of these models to the elliptic…
We consider a class of algebraic dynamical systems introduced by Kitchens and Schmidt. Under a weak finiteness condition -- the Descending Chain Condition -- the dual modules have finite presentations. Using methods from commutative algebra…
Huemer et al. (Discrete Math, 2019) proved that for any two finite point sets $R$ and $B$ in the plane with $|R| = |B|$, the perfect matching that matches points of $R$ with points of $B$, and maximizes the total squared Euclidean distance…
We prove some uniqueness results for conics of minimal area that enclose a compact, full-dimensional subset of the elliptic plane. The minimal enclosing conic is unique if its center or axes are prescribed. Moreover, we provide sufficient…
The category of framed correspondences Fr_*(k), framed presheaves and framed sheaves were invented by Voevodsky in his unpublished notes [17]. Based on the notes [17] a new approach to the classical Morel--Voevodsky motivic stable homotopy…
A characterization of a class of optimal three-weight cyclic codes of dimension 3 over any finite field was recently presented in [10]. Shortly after this, a generalization for the sufficient numerical conditions of such characterization…
In this article, We introduce a condition that is both necessary and sufficient for a linear code to achieve minimality when analyzed over the rings $\mathbb{Z}_{n}$.The fundamental inquiry in minimal linear codes is the existence of a…
Three philosophical principles are often quoted in connection with Leibniz: "objects sharing the same properties are the same object", "everything can possibly exist, unless it yields contradiction", "the ideal elements correctly determine…
Huemer et al. (Discrete Mathematics, 2019) proved that for any two point sets $R$ and $B$ with $|R|=|B|$, the perfect matching that matches points of $R$ with points of $B$, and maximizes the total \emph{squared} Euclidean distance of the…
In a previous paper, we showed nonvaninishing of the universal index elements in the K-theory of the maximal C*-algebras of the fundamental groups of enlargeable spin manifolds. The underlying notion of enlargeability was the one from the…