Suppression of flavor symmetry breaking in B decay sum rules

While flavor symmetries are useful for studying hadronic B   decays, symmetry relations for amplitudes and decay rates are usually violated by first order symmetry breaking corrections. We point out two cases in which first order symmetry breaking is suppressed by a small ratio of amplitudes: (1) An isospin sum rule for four B→Kπ$B\to K\pi$ decays, where isospin breaking is shown to be negligible. (2) An SU(3)$\mathrm{SU}(3)$ sum rule for pairs of B→Kπ$B\to K\pi$ and B→Kη₈$B\to K{\eta }_8$, generalized to pairs of B→Kπ$B\to K\pi$, B→Kη$B\to K\eta$ and B→Kη^′$B\to K{\eta }^{\prime }$.     

On maximal antichains containing no set and its complement

Let 1?k₁?k₂?…?k_n be integers and let S denote the set of all vectors x = (x₁, …, x_n with integral coordinates satisfying 0?x_i?k_i, i = 1,2, …, n; equivalently, S is the set of all subsets of a multiset consisting of k_i elements of type i, i = 1,2, …, n. A subset X of S is an antichain if and only if for any two vectors x and y in X the inequalities x_i?y_i, i = 1,2, …, n, do not all hold. For an arbitrary subset H of S, (i)H denotes the subset of H consisting of vectors with component sum i, i = 0, 1, 2, …, K, where K = k₁ + k₂ + …k_n. |H| denotes the number of vectors in H, and the complement of a vector x?S is (k₁-x₁, k₂-x₂, …, k_n -x_n). What is the maximal cardinality of an antichain containing no vector and its complement? The answer is obtained as a corollary of the following theorem: if X is an antichain, K is even and$\text{|(}\text{1}\text{2}\text{K)X|}$ does not exceed the number of vectors in $\text{(}\text{1}\text{2}\text{K)S}$ with first coordinate different from k₁, then

$\text{∑}\text{i=0}\text{K}\text{i≠}\text{1}\text{2}\text{K}\text{|(i)X|}\text{|(i)S|}\text{+}\text{|(}\text{1}\text{2}\text{K)X|}\text{|(}\text{1}\text{2}\text{K-1)S|}\text{?1}$

.     

The Automorphism Group of the Subsequence Poset B m,n

In this paper we are interested in the automorphism group of the poset B _{m, n} . B _{m, n} constitutes the words obtained from the cyclic word of length n on an alphabet of m letters in by deleting on all possible ways and their natural order. We prove: Résumé: Le but de ce papier est la détermination du groupe d"automorphismes des ordres B _{m, n} . Il s"agit des mots obtenus à partir du mot cyclique de longeur n sur un alphabet de m lettres par suppression successive de lettres et ordonnés naturellement. On prouve: AutB _{m, n} = {S _n for 1 n m, S ₂ S _2m-n for m + 1n 2m - 1, S ₂for 2m n.