相关论文: A generalization of balanced tableaux and marriage…

This paper is devoted to general balance laws (with a possibly non local source term) with a non-characteristic boundary. Basic well posedness results are obtained, trying to provide sharp estimates. In particular, bounds tend to blow up as…

We introduce balanced shifted tableaux, as an analogue of balanced tableaux of Edelman and Greene, from the perspective of root systems of type B and C. We show that they are equinumerous to standard Young tableaux of the corresponding…

We propose a generalization of Halls marriage theorem. The generalization given here provides a necessary sufficient condition for arranging a successful friendship among n number of k sets. We define multimatrix, multideterminant,…

Let $A$ be a semisimple Banach algebra with non-trivial, and possibly infinite-dimensional socle. Addressing a problem raised by Harte and Hernandez, we first define a characteristic polynomial for elements belonging to the socle, and we…

In Pawlak rough sets, the structure of the definable set families is simple and clear, but in generalizing rough sets, the structure of the definable set families is a bit more complex. There has been much research work focusing on this…

Consider a haploid population of fixed finite size with a finite number of allele types and having Cannings exchangeable genealogy with neutral mutation. The stationary distribution of the Markov chain of allele counts in each generation is…

The hook length formula for $d$-complete posets expresses the number of linear extensions of a $d$-complete poset $P$ in terms of hooks of $P$. It generalizes the usual hook length formula for standard Young tableaux, as well as hook length…

In this paper, a theorem is proved that generalizes several existing amalgamation results in various ways. The main aim is to disentangle a given edge-colored amalgamated graph so that the result is a graph in which the edges are shared out…

We generalize Philip Hall's celebrated theorems on finite solvable groups to scheme theory. Our result is based on a series of results on hypergroups.

We introduce and develop the theory of UMEL-shellable posets. These are posets equipped with an edge-lexicographical labeling satisfying certain uniformity and monotonicity properties. This framework encompasses classical families of…

We present a conjectual hook formula concerning the number of the standard tableaux on "cylindric" skew diagrams. Our formula can be seen as an extension of Naruse's hook formula for skew diagrams. Moreover, we prove our conjecture in some…

In this note we define summable families in tempered distribution spaces and we state some their properties and characterizations. Summable families are the analogous of summable sequences in separable Hilbert spaces, but in tempered…

Motivated by the application of Hall's Marriage Theorem in various LP-rounding problems, we introduce a generalization of the classical marriage problem (CMP) that we call the Fractional Marriage Problem. We show that the Fractional…

The Gale-Shapley algorithm for the Stable Marriage Problem is known to take $\Theta(n^2)$ steps to find a stable marriage in the worst case, but only $\Theta(n \log n)$ steps in the average case (with $n$ women and $n$ men). In 1976, Knuth…

We provide a characterization for a periodic system of generalized Sylvester and conjugate-Sylvester equations, with at most one generalized conjugate-Sylvester equation, to have a unique solution when all coefficient matrices are square…

We review known linear and matrix generalizations of Hall's classic ``marriage theorem'' and K\H{o}nig's theorem on partial matchings in bipartite graphs, and relate them to linear and matrix generalizations of Dilworth's theorem about…

Using the framework of Colombeau algebras of generalized functions, we prove the existence and uniqueness results for global generalized solvability of semilinear hyperbolic systems with nonlinear nonlocal boundary conditions. We admit…

Asking which sets are fixed-parameter tractable for a given parameterization constitutes much of the current research in parameterized complexity theory. This approach faces some of the core difficulties in complexity theory. By focussing…

Recently, a simple proof of the hook length formula was given via the branching rule. In this paper, we extend the results to shifted tableaux. We give a bijective proof of the branching rule for the hook lengths for shifted tableaux;…

Closed formulas are known for $S(k,0;n)$, the number of standard Young tableaux of size $n$ and with at most $k$ parts, where $1\le k\le 5$. Here we study the analogue problem for $S(k,\ell;n)$, the number of standard Young tableaux of size…