„The vision of a prosperous agriculturally based market economy in which increasingly diversified and commercially oriented small farmers with secure and exchangeable land rights, able not only to feed but also to remunerate themselves and their families while supplying [...] growing cities, generating local employment and national revenue, is powerful, attractive, motivating and valid. The que...

In manual translation of patent documents, a technical term bilingual lexicon is inevitable for a translator to efficiently translate patent documents. Dong et al. (2015) proposed a method of generating bilingual technical term lexicon from morpheme-segmented parallel patent sentences. The proposed method estimates Japanese-Chinese translation of technical terms using the phrase translation tab...

We describe a framework for systematic enumeration of families combinatorial structures which possess a certain regularity. More precisely, we describe how to obtain the differential equations satisfied by their generating series. These differential equations are then used to determine the initial terms in the counting sequence and for asymptotic analysis. The key tool is the scalar product for...

The object of the present paper is to investigate several general families of bilinear and bilateral generating functions with different argument for the Gauss’ hypergeometric polynomials. Mathematics Subject Classification(2010): Primary 42C05, Secondary 33C45. Keywords—Appell’s functions, Gauss hypergeometric functions, Heat polynomials, Kampe’ de Fe’riet function, Laguerre polynomials, Lauri...

In this paper we study the growth rates of Artin monoids and we show that 4 is a universal upper bound. We also show that the generating functions of the associated right-angled Artin monoids are given by families of Chebyshev polynomials. Applications to Artin groups and positive braids are given.

We prove the rationality of the generating function associated to the number of equivalence classes of Fqk -points of a constructible equivalence relation defined over the finite field Fq . This is a consequence of the rationality of Weil zeta functions and of first-order formulas, together with the existence of a suitable parameter space for constructible families of constructible sets.

We present a method of generating infinite words from selective substitution grammars introduced by Rozenberg (1977). Comparison is made with some of the well-known limiting processes and limit language families and certain closure properties are examined. A technique is given for obtaining infinite non-repetitive words. Several decidability results are established.

We describe a general algorithm for generating various families of ribbon tableaux and computing their spin polynomials. This algorithm is derived from a new matricial coding. An advantage of this new notation lies in the fact that it permits one to generate ribbon tableaux with skew shapes.

Seo and others have generalized an identity of Postnikov by finding expressions for the generating function for the number of proper vertices in certain families of rooted trees and forests. We describe an approach to these results that involves a straightforward inductive argument and a version of the Lambert-Rothe identities.

Generalized Frobenius partitions, or F -partitions, have recently played an important role in several combinatorial investigations of basic hypergeometric series identities. The goal of this paper is to use the framework of these investigations to interpret families of infinite products as generating functions for F -partitions. We employ q-series identities and bijective combinatorics.