Related papers: On a Generalization of the Marriage Problem
We study two modifications of the Post Correspondence Problem (PCP), namely 1) the bi-infinite version, where it is asked whether there exists a bi-infinite word such that two given morphisms agree on it, and 2) the conjugate version, where…
We generalize the Tutte polynomial of a matroid to a morphism of matroids via the K-theory of flag varieties. We introduce two different generalizations, and demonstrate that each has its own merits, where the trade-off is between the ease…
We study deviations by a group of agents in the three main types of matching markets: the house allocation, the marriage, and the roommates models. For a given instance, we call a matching $k$-stable if no other matching exists that is more…
The method of separation of variables is significant, it has been applied to physics, engineering , chemistry and other fields. It allows to reduce the diffculity of problems by separating the variables from partial differential equation…
We consider anti-unification for simply typed lambda terms in associative, commutative, and associative-commutative theories and develop a sound and complete algorithm which takes two lambda terms and computes their generalizations in the…
This research offers a comprehensive approach to strengthening both monogamous and polygamous relationships within the context of quantum correlations in multipartite quantum systems. We present the most stringent bounds for both monogamy…
In this work, we establish a representation theorem for multivariable totally symmetric functions: a multisymmetric continuous function must be the composition of a continuous function and a set of generators of the multisymmetric…
We give a solution of the following combinatorial problem: "Let one from $n$ married couples in the m\'enage problem (see Problem 1) be a couple of a known mathematician $M$ and his wife. After the ladies are seated at every other chair,…
The natural generalization of the Boolean satisfiability problem to optimization problems is the task of determining the maximum number of clauses that can simultaneously be satisfied in a propositional formula in conjunctive normal form.…
We introduce the convex combinatorial optimization problem, a far reaching generalization of the standard linear combinatorial optimization problem. We show that it is strongly polynomial time solvable over any edge-guaranteed family, and…
We prove that the isomorphism problem is decidable for generalized Baumslag-Solitar (GBS) groups with one quasi-conjugacy class and full support gaps. In order to do so we introduce a family of invariants that fully characterize the…
The classical Hermite-Biehler theorem describes possible zero sets of complex linear combinations of two real polynomials whose zeros strictly interlace. We provide the full characterization of zero sets for the case when this interlacing…
The Tutte polynomial is a well-studied invariant of graphs and matroids. We first extend the Tutte polynomial from graphs to hypergraphs, and more generally from matroids to polymatroids, as a two-variable polynomial. Our definition is…
In this paper we show that when individuals in a bipartite network exclusively choose partners and exchange valued goods with their partners, then there exists a set of exchanges that are pair-wise stable. Pair-wise stability implies that…
Monogamy of entanglement is generally discussed using a bipartite entanglement measure as an upper bound. Here we discuss a new kind of monogamous relation where the upper bound is given by a multipartite measure of entanglement, the…
Variational relation problems allow a general approach for variational inequalities, equilibrium problems, optimization problems, variational inclusions. In this paper we consider a system of quasi-variational relations and determine some…
We prove the following variant of Helly's classical theorem for Hamming balls with a bounded radius. For $n>t$ and any (finite or infinite) set $X$, if in a family of Hamming balls of radius $t$ in $X^n$, every subfamily of at most…
A univariate polynomial equation is presented. It provides models of the thermal lattice Boltzmann equation. The models can be accurate up to any required level and can be applied to regular lattices, which allow efficient and accurate…
In a nutshell, we show that polynomials and nested polytopes are topological, algebraic and algorithmically equivalent. Given two polytops $A\subseteq B$ and a number $k$, the Nested Polytope Problem (NPP) asks, if there exists a polytope…
We study the Stable Fixtures problem, a many-to-many generalisation of the classical non-bipartite Stable Roommates matching problem. Building on the foundational work of Tan on stable partitions, we extend his results to this significantly…