Related papers: On a Generalization of the Marriage Problem
The isomorphism problem means to decide if two given finite-dimensional simple algebras over the same centre are isomorphic and, if so, to construct an isomorphism between them. A solution to this problem has applications in computational…
We study the computability of the operator norm of a matrix with respect to norms induced by linear operators. Our findings reveal that this problem can be solved exactly in polynomial time in certain situations, and we discuss how it can…
Beginning from the resolution of Dirichlet L function, using the inner product formula of infinite-dimensional vectors in the complex space, the author proved the world's baffling problem--Generalized Riemann hypothesis.
The symmetry group method is applied to a generalized Korteweg-de Vries equation and several classes of group invarint solution for it are obtained by means of this technique. Polynomial, trigonometric and elliptic function solutions can be…
We introduce a new and broader formulation of the stable marriage problem (SMP), called the stable polygamy problem (SPP), where multiple individuals from a larger group $L$ of $|L|$ individuals can be matched with a single individual from…
Generalized Feller theory provides an important analog to Feller theory beyond locally compact state spaces. This is very useful for solutions of certain stochastic partial differential equations, Markovian lifts of fractional processes, or…
New theorems about the existence of solution for a system of infinite linear equations with a Vandermonde type matrix of coefficients are proved. Some examples and applications of these results are shown. In particular, a kind of these…
A weight-dependent generalization of the binomial theorem for noncommuting variables is presented. This result extends the well-known binomial theorem for q-commuting variables by a generic weight function depending on two integers. For a…
Generalizing the classical matrix-tree theorem we provide a formula counting subgraphs of a given graph with a fixed 2-core. We use this generalization to obtain an analog of the matrix-tree theorem for the root system $D_n$ (the classical…
Let $G=(U \cup V, E)$ be a bipartite graph, where $U$ represents jobs and $V$ represents machines. We study a new variant of the bipartite matching problem in which each job in $U$ can be matched to at most one machine in $V$, and the…
We derive a generalized matrix version of Pellet's theorem, itself based on a generalized Rouch\'{e} theorem for matrix-valued functions, to generate upper, lower, and internal bounds on the eigenvalues of matrix polynomials. Variations of…
We provide sufficient conditions for systems of polynomial equations over general (real or complex) algebras to have a solution. This generalizes known results on quaternions, octonions and matrix algebras. We also generalize the…
We study three new versions of the All-Ones Problem and the Minimum All-Ones Problem. The original All-Ones Problem is simply called the Vertex-Vertex Problem, and the three new versions are called the Vertex-Edge Problem, the Edge-Vertex…
Several proposals to deal with the dynamics of general relativity involve gauge fixings or the introduction matter fields in terms of which the theory is deparameterized. The resulting theories have true Hamiltonians for their evolution…
This paper examines the classical matching distribution arising in the "problem of coincidences". We generalise the classical matching distribution with a preliminary round of allocation where items are correctly matched with some fixed…
We propose a new integral based on Taylor measures, study its properties extensively, and we illustrate that it includes many concepts from mathematics as special cases. In particular, the new integral emerges as a generalization of the…
Let $G = (A \cup B,E)$ be a bipartite graph where the set $A$ consists of agents or main players and the set $B$ consists of jobs or secondary players. Every vertex has a strict ranking of its neighbors. A matching $M$ is popular if for any…
The Stable Matching Problem with Couples (SMP-C) is a ubiquitous real-world extension of the stable matching problem (SMP) involving complementarities. Although SMP can be solved in polynomial time, SMP-C is NP-Complete. Hence, it is not…
Given $2n$ points in the plane, it is well-known that there always exists a perfect straight-line non-crossing matching. We show that it is $NP$-complete to decide if a partial matching can be augmented to a perfect one, via a reduction…
Lattice theoretical generalizations of some classical linear algebra results are formulated. A vector space is replaced by its subspace lattice and a linear map is replaced by the induced lattice map. This map is a complete join…