相关论文: On a Generalization of the Marriage Problem

Monogamy and polygamy relations characterize the quantum correlation distributions among multipartite quantum systems. We investigate the monogamy and polygamy relations satisfied by measures of general quantum correlation. By using the…

In the stable marriage problem (SM), a mechanism that always outputs a stable matching is called a stable mechanism. One of the well-known stable mechanisms is the man-oriented Gale-Shapley algorithm (MGS). MGS has a good property that it…

Let $G = (A \cup B, E)$ be an instance of the stable marriage problem with strict preference lists. A matching $M$ is popular in $G$ if $M$ does not lose a head-to-head election against any matching where vertices are voters. Every stable…

Let $L$ be any finite distributive lattice and $B$ be any boolean predicate defined on $L$ such that the set of elements satisfying $B$ is a sublattice of $L$. Consider any subset $M$ of $L$ of size $k$ of elements of $L$ that satisfy $B$.…

We embed general boundary value problems for the time-harmonic Maxwell equations into the elliptic boundary value theory. This is achieved by introducing two new scalar functions to the electromagnetic field and imposing additional boundary…

We establish some new generalizations of Erd\H{o}s-Mordell inequality by adding weights to its terms. Using these generalizations, we derived strengthened versions of the original Erd\H{o}s-Mordell inequality. We also found two other…

In this note we propose a generalization of the Laplace and Fourier transforms which we call symmetric Laplace transform. It combines both the advantages of the Fourier and Laplace transforms. We give the definition of this generalization,…

The matroid parity (or matroid matching) problem, introduced as a common generalization of matching and matroid intersection problems, is so general that it requires an exponential number of oracle calls. Nevertheless, Lov\'asz (1980)…

We present new mixture representations for the generalized Linnik distribution in terms of normal, Laplace, exponential and stable laws and establish the relationship between the mixing distributions in these representations. Based on these…

Are you having trouble getting married? These days, there are lots of products on the market for dating, from apps to websites and matchmakers, but we know a simpler way! That's right -- your path to coupled life isn't through Tinder: it's…

In a recent work [1, 2] Sjoberg remarked that generalization of the double reduction theory to partial differential equations of higher dimensions is still an open problem. In this note we have attempted to provide this generalization to…

Let K be an infinite field and let R be a K-algebra endowed with a homogeneous polynomial norm N of degree n. If N satisfies a formal analogue of the Cayley-Hamilton Theorem the we will show that R is a quotient of the ring of the…

We study the problem of factoring univariate polynomials over finite fields. Under the assumption of the Extended Riemann Hypothesis (ERH), (Gao, 2001) designed a polynomial time algorithm that fails to factor only if the input polynomial…

The problem of completing a partially specified n by n Latin square is solved by an alternative proof, based on filling the rows (or diagonals) from 1 to n, using an extended form of Hall's marriage theorem.

This paper studies the polynomial optimization problem whose feasible set is a union of several basic closed semialgebraic sets. We propose a unified hierarchy of Moment-SOS relaxations to solve it globally. Under some assumptions, we prove…

For $n \geq 3$, an asymptotic formula is derived for the number of representations of a sufficiently large natural number $N$ as a sum of $r = 2^n + 1$ summands, each of which is an $n$-th power of natural numbers $x_i$, $i = \overline{1,…

In this paper, we generalize the notions of perfect matchings, perfect 2-matchings to perfect k-matchings and give a necessary and sufficient condition for existence of perfect k-matchings. For bipartite graphs, we show that this k-matching…

We consider popular matching problems in both bipartite and non-bipartite graphs with strict preference lists. It is known that every stable matching is a min-size popular matching. A subclass of max-size popular matchings called dominant…

The Schmidt number is of crucial importance in characterizing the bipartite pure states. We explore and propose here a generalization of Schmidt number for states in multipartite systems. It is shown to be entanglement monotonic and valid…

We characterize the initial positions from which the first player has a winning strategy in a certain two-player game. This provides a generalization of Hall's theorem. Vizing's edge coloring theorem follows from a special case.