Search results for "Crete"
showing 10 items of 2495 documents
Generalized Schröder permutations
2013
We give the generating function for the integer sequence enumerating a class of pattern avoiding permutations depending on two parameters: m and p. The avoided patterns are the permutations of length m with the largest element in the first position and the second largest in one of the last p positions. For particular instances of m and p we obtain pattern avoiding classes enumerated by Schroder, Catalan and central binomial coefficient numbers, and thus, the obtained two-parameter generating function gathers under one roof known generating functions and expresses new ones. This work generalizes some earlier results of Barcucci et al. (2000) [2], Kremer (2000) [5] and Kremer (2003) [6].
Unavoidable sets and circular splicing languages
2017
Circular splicing systems are a formal model of a generative mechanism of circular words, inspired by a recombinant behaviour of circular DNA. They are defined by a finite alphabet A, an initial set I of circular words, and a set R of rules. In this paper, we focus on the still unknown relations between regular languages and circular splicing systems with a finite initial set and a finite set R of rules represented by a pair of letters ( ( 1 , 3 ) -CSSH systems). When R = A × A , it is known that the set of all words corresponding to the splicing language belongs to the class of pure unitary languages, introduced by Ehrenfeucht, Haussler, Rozenberg in 1983. They also provided a characteriza…
Absolute continuity for Banach space valued mappings
2007
We consider the notion of p,λ,δ-absolute continuity for Banach space valued mappings introduced in [2] for real valued functions and for λ = 1. We investigate the validity of some basic properties that are shared by n, λ-absolutely continuous functions in the sense of Maly and Hencl. We introduce the class $δ-BV^p_{λ,loc}$ and we give a characterization of the functions belonging to this class.
Restricted 123-avoiding Baxter permutations and the Padovan numbers
2007
AbstractBaxter studied a particular class of permutations by considering fixed points of the composite of commuting functions. This class is called Baxter permutations. In this paper we investigate the number of 123-avoiding Baxter permutations of length n that also avoid (or contain a prescribed number of occurrences of) another certain pattern of length k. In several interesting cases the generating function depends only on k and is expressed via the generating function for the Padovan numbers.
The Natural Order-Generic Collapse for ω-Representable Databases over the Rational and the Real Ordered Group
2001
We consider order-generic queries, i.e., queries which commute with every order-preserving automorphism of a structure's universe. It is well-known that first-order logic has the natural order-generic collapse over the rational and the real ordered group for the class of dense order constraint databases (also known as finitely representable databases). I.e., on this class of databases over 〈Q, <〉 or 〈R, <〉, addition does not add to the expressive power of first-order logic for defining order-generic queries. In the present paper we develop a natural generalization of the notion of finitely representable databases, where an arbitrary (i.e. possibly infinite) number of regions is allowed. We …
Combinatorial aspects of L-convex polyominoes
2007
We consider the class of L-convex polyominoes, i.e. those polyominoes in which any two cells can be connected with an ''L'' shaped path in one of its four cyclic orientations. The paper proves bijectively that the number f"n of L-convex polyominoes with perimeter 2(n+2) satisfies the linear recurrence relation f"n"+"2=4f"n"+"1-2f"n, by first establishing a recurrence of the same form for the cardinality of the ''2-compositions'' of a natural number n, a simple generalization of the ordinary compositions of n. Then, such 2-compositions are studied and bijectively related to certain words of a regular language over four letters which is in turn bijectively related to L-convex polyominoes. In …
Enumerable classes of total recursive functions: Complexity of inductive inference
1994
This paper includes some results on complexity of inductive inference for enumerable classes of total recursive functions, where enumeration is considered in more general meaning than usual recursive enumeration. The complexity is measured as the worst-case mindchange (error) number for the first n functions of the given class. Three generalizations are considered.
Fixed Points for Weakα-ψ-Contractions in Partial Metric Spaces
2013
Recently, Samet et al. (2012) introduced the notion ofα-ψ-contractive mappings and established some fixed point results in the setting of complete metric spaces. In this paper, we introduce the notion of weakα-ψ-contractive mappings and give fixed point results for this class of mappings in the setting of partial metric spaces. Also, we deduce fixed point results in ordered partial metric spaces. Our results extend and generalize the results of Samet et al.
Fitting classes ℱ such that all finite groups have ℱ-injectors
1986
Let ℱ be an homomorph and Fitting class such thatEzℱ=ℱ. In this paper we prove that if all ℱ-constrained groups have ℱ-injectors, then all groups have ℱ-injectors. In particular if ℱ is a class of quasinilpotent groups containing the nilpotent groups, then every group has ℱ-injectors.
Existentially closed central extensions of locally finite p-groups
1986
Throughout, p will be a fixed prime, and will denote the class of all locally finite p-groups. For a fixed Abelian p-group A, we letwhere ζ(P) denotes the centre of P. Notice that A is not a class in the usual group-theoretic sense, since it is not closed under isomorphisms.