Computing the partial word avoidability indices of ternary patterns

We study pattern avoidance in the context of partial words. The problem of classifying the avoidable binary patterns has been solved, so we move on to ternary and more general patterns. Our results, which are based on morphisms (iterated or not), determine all the ternary patternsʼ avoidability indices or at least give bounds for them.     

New weighted Rogers-Ramanujan partition theorems and their implications

This paper has a two-fold purpose. First, by considering a reformulation of a deep theorem of Göllnitz, we obtain a new weighted partition identity involving the Rogers-Ramanujan partitions, namely, partitions into parts differing by at least two. Consequences of this include Jacobi's celebrated triple product identity for theta functions, Sylvester's famous refinement of Euler's theorem, as well as certain weighted partition identities. Next, by studying partitions with prescribed bounds on successive ranks and replacing these with weighted Rogers-Ramanujan partitions, we obtain two new sets of theorems - a set of three theorems involving partitions into parts (mod 6), and a set of three theorems involving partitions into parts (mod 7), .

     

A proof of W. T. Gowers' theorem

W. T. Gowers' theorem asserts that for every Lipschitz function and 0$">, there exists an infinite-dimensional subspace of such that the oscillation of on is at most . The proof of this theorem has been reduced by W. T. Gowers to the proof of a new Ramsey type theorem. Our aim is to present a proof of the last result.

     

Generalized Bicyclic Semigroups and Jones Semigroups

In this paper, we consider the generalized bicyclic semigroups B_n = a, b | aⁿb = 1 and the Jones semigroups A_n = a, b | aⁿ⁺¹b = a. They are the generalizations of the bicyclic semigroup B = a, b | ab = 1 and its analogous semigroup A = a, b | a²b = a discovered by P.R., Jones in 1987. The word problem for these kinds of semigroups is solved. It is proved that, for n 2, B_n are bisimple right inverse but not inverse semigroups and that the semigroup C = a, b | a²b = a, ab² = b is the smallest idempotent-free homomorphic image of A_n. Moreover, we also prove that A_n and A_m are mutually embeddable but not isomorphic with each other if n m. As a consequence, different kind of -nontrivial [0-]simple semigroups without idempotents are discussed.AMS 1991 Subject Classification: primary 20M10 secondary 20M05.Supported by NNSF of China (19671063) and KSRF of Sichuan Education Committee ([1999]127).     

Powerful arithmetic progressions

We give a complete characterization of so-called powerful arithmetic progressions, i.e. of progressions whose kth term is a kth power for all k. We also prove that the length of any primitive arithmetic progression of powers can be bounded both by any term of the progression different from 0 and ±1, and by its common difference. In particular, such a progression can have only finite length.     

Marcus contextual languages consisting of primitive words

In this paper we prove that the language of all primitive (strongly primitive) words over a nontrivial alphabet can be generated by certain types of Marcus contextual grammars.     

On finite unions of ideals and cosets

Abstract

Although it is well known that the growth of Thompson's group F is exponential, the exact growth function is still unknown. Elements of its submonoid of positive words can be described using a binary rooted tree, whose norm can be computed assigning weights to each caret. Combining this fact with a combinatorial argument, the growth function of the submonoid is computed and thus providing a first step in the computation of the growth function of the group, as well as a lower bound for the growth rate for the group.     

Combinatorics on words in symbolic dynamics: the antisymmetric cubic map

This paper is contributed to the combinatorial properties of the periodic kneading words of antisymmetric cubic maps defined on a interval. The least words of given lengths, the adjacency relations on the words of given lengths and the parity-alternative property in some sets of such words are established.     

Iodine-catalyzed aerobic oxidation of o-alkylazoarenes to 2H-indazoles

An iodine-catalyzed aerobic-oxidative C-H functionalization of o-alkylazoarenes to afford 2H-indazoles has been developed. CuI was found to be an effective additive to accelerate the regeneration of iodine in the catalytic cycle. This catalytic system is suitable for both electron-rich and electron-deficient azoarenes and tolerates a variety of functional groups with high yields. A gram-scale reaction was successfully conducted, proving the scalability of this reaction.     

Upper bound on key generation rate of quantum key distribution with two-way or two-step quantum channels

We present an asymptotic security proof of deterministic quantum key distribution (DQKD) with a two-way quantum channel. The security proof of DQKD with a two-way quantum channel is different from that of BB84, because Eve can attack the travel qubits twice, both in line Bob to Alice and in line Alice to Bob. With the no-signaling principle and the property of mutual information, we obtain an upper bound of the final key generation of entanglement-based DQKD and hence single-photon four-state DQKD. Our results can be applied to the protocol of QKD with two-step quantum channels.