相关论文: A generalization of balanced tableaux and marriage…
Tree-child networks are an important class of phylogenetic network used to model reticulate evolutionary processes. These networks have attracted increasing attention from researchers with interests in both combinatorics and algorithms. A…
A generalization of the usual ideles group is proposed, namely, we construct certain adelic complexes for sheaves of $K$-groups on schemes. More generally, such complexes are defined for any abelian sheaf on a scheme. We focus on the case…
Hall's Theorem is a basic result in Combinatorics which states that the obvious necesssary condition for a finite family of sets to have a transversal is also sufficient. We present a sufficient (but not necessary) condition on the sizes of…
In this note, we formulate and prove branching rules of simple polynomial modules for the Lie superalgebra $\mathfrak{gl}(m|n)$. Our branching rules depend on the conjugacy class of the Borel subalgebra. A Gelfand-Tsetlin basis of a…
A generalized Baumslag-Solitar group is the fundamental group of a graph of groups all of whose vertex and edge groups are infinite cyclic. Levitt proves that any generalized Baumslag-Solitar group has property R-infinity, that is, any…
This paper concerns a relatively new combinatorial structure called staircase tableaux. They were introduced in the context of the asymmetric exclusion process and Askey--Wilson polynomials, however, their purely combinatorial properties…
We assign a relational structure to any finite algebra in a canonical way, using solution sets of equations, and we prove that this relational structure is polymorphism-homogeneous if and only if the algebra itself is…
We propose a generalization of the classical stable marriage problem. In our model, the preferences on one side of the partition are given in terms of arbitrary binary relations, which need not be transitive nor acyclic. This generalization…
In the stable marriage and roommates problems, a set of agents is given, each of them having a strictly ordered preference list over some or all of the other agents. A matching is a set of disjoint pairs of mutually accepted agents. If any…
Guba and Sapir asked if the simultaneous conjugacy problem was solvable in Diagram Groups or, at least, for Thompson's group F. We give a solution to the latter question using elementary techniques which rely purely on the description of F…
For any $n$ nonnegative integer a family of groups, denoted by $ \mathcal{D}_n $, was introduce by Bianchi et al., as the collection of all finite groups with exactly $n$ conjugacy classes of nontrivial, non self-normalizing subgroups. It…
We discuss universality properties of blow-up of a classical (smooth) solutions of conservation laws in one space dimension. It is shown that the renormalized wave profile tends to a universal function, which is independent both of initial…
The Union Closed Sets Conjecture is one of the most renowned problems in combinatorics. Its appeal lies in the simplicity of its statement contrasted with the potential complexity of its resolution. The conjecture posits that, in any union…
We provide necessary and sufficient conditions for the generalized $\star$-Sylvester matrix equation, $AXB + CX^\star D = E$, to have exactly one solution for any right-hand side E. These conditions are given for arbitrary coefficient…
In the paper we develop a general theory of solvability of linear inhomogeneous boundary-value problems for systems of first-order ordinary differential equations in spaces of smooth functions on a finite interval. This problems are set…
In this paper, we introduce a new class of parameterized problems, which we call XALP: the class of all parameterized problems that can be solved in $f(k)n^{O(1)}$ time and $f(k)\log n$ space on a non-deterministic Turing Machine with…
Let h^{*} be a multiplicative cohomology theory, h_{*} its dual homology theory and \hat{h}^{*} a differential refinement. We first construct the natural pairing between h_{*} and the flat part of \hat{h}^{*}, generalizing the holonomy of a…
Generalized friendship paradoxes occur when, on average, our friends have more of some attribute than us. These paradoxes are relevant to many aspects of human interaction, notably in social science and epidemiology. Here, we derive new…
We study the optimization of the stable marriage problem. All individuals attempt to optimize their own satisfaction, subject to mutually conflicting constraints. We find that the stable solutions are generally not the globally best…
We study the convex hulls of reachable sets of nonlinear systems with bounded disturbances and uncertain initial conditions. Reachable sets play a critical role in control, but remain notoriously challenging to compute, and existing…