Related papers: A generalized marriage theorem

We compute the cohomology ring of a generalised type of configuration space of points in $\mathbb{R}^r$. This configuration space is indexed by a graph. In the case the graph is complete the result is known and it is due to Arnold and…

Characterizing graphs by their spectra is a fundamental and challenging problem in spectral graph theory, which has received considerable attention in recent years. A major unsolved conjecture in this area is Haemers' conjecture which…

We prove that any degree $d$ rational map having a parabolic fixed point of multiplier $1$ with a fully invariant and simply connected immediate basin of attraction is mateable with the Hecke group $H_{d+1}$, with the mating realized by an…

We prove an analogue of the classical ballot theorem that holds for any random walk in the range of attraction of the normal distribution. Our result is best possible: we exhibit examples demonstrating that if any of our hypotheses are…

The point-line geometry known as a \textit{partial quadrangle} (introduced by Cameron in 1975) has the property that for every point/line non-incident pair $(P,\ell)$, there is at most one line through $P$ concurrent with $\ell$. So in…

In this paper we introduce generalised Markov numbers and extend the classical Markov theory for the discrete Markov spectrum to the case of generalised Markov numbers. In particular we show recursive properties for these numbers and find…

Some aspects of the problem of stable marriage are discussed. There are two distinguished marriage plans: the fully transferable case, where money can be transferred between the participants, and the fully non transferable case where each…

We give combinatorial generalizations of the Cayley-Bacharach theorem and induced map.

Wei's celebrated Duality Theorem is generalized in several ways, expressed as duality theorems for linear codes over division rings and, more generally, duality theorems for matroids. These results are further generalized, resulting in two…

When $R$ is a Noetherian ring and we have a family of ideals in which every ideal contains at least one nonzero divisor, then it is already known that the defining ideal of the multi-Rees algebra of these ideals is equal to a saturated…

Planar linkages are a rich area of study motivated by practical applications in engineering mechanisms. A central result is Kempe's Universality Theorem, which states that semi-algebraic sets can be realized by planar linkages. Polyhedral…

In this paper, we prove a generalization of Geraghty's fixed point theorem for multi--valued mappings.

Let $G$ be a regular graph and $H$ a subgraph on the same vertex set. We give surprisingly compact formulas for the number of copies of $H$ one expects to find in a random subgraph of $G$.

We define a graded graph, called the Schur--Weyl graph, which arises naturally when one considers simultaneously the RSK algorithm and the classical duality between representations of the symmetric and general linear groups. As one of the…

Many facts possess symmetrical counterparts that often require a separate formal proof, depending on the nature of the involved symmetry. We introduce a method in Isabelle/HOL which produces such a symmetrical fact for the list datatype and…

In many instances one has to deal with parametric models. Such models in vector spaces are connected to a linear map. The reproducing kernel Hilbert space and affine- / linear- representations in terms of tensor products are directly…

We give one more proof of the fact that symplectic matrices over real and complex fields have determinant one. While this has already been proved many times, there has been lasting interest in finding an elementary proof. Our result is…

The Tutte polynomial for matroids is not directly applicable to polymatroids. For instance, deletion-contraction properties do not hold. We construct a polynomial for polymatroids which behaves similarly to the Tutte polynomial of a…

We consider a matching problem in a bipartite graph $G$ where every vertex has a capacity and a strict preference order on its neighbors. Furthermore, there is a cost function on the edge set. We assume $G$ admits a perfect matching, i.e.,…

We work with semi-algebraic functions on arbitrary real closed fields. We generalize the notion of critical values and prove a Sard type theorem in our framework.