Search results for "combinatoric"
showing 10 items of 1776 documents
Dyck paths with a first return decomposition constrained by height
2018
International audience; We study the enumeration of Dyck paths having a first return decomposition with special properties based on a height constraint. We exhibit new restricted sets of Dyck paths counted by the Motzkin numbers, and we give a constructive bijection between these objects and Motzkin paths. As a byproduct, we provide a generating function for the number of Motzkin paths of height k with a flat (resp. with no flats) at the maximal height. (C) 2018 Elsevier B.V. All rights reserved.KeywordsKeyWords Plus:STATISTICS; STRINGS
Enumeration of Łukasiewicz paths modulo some patterns
2019
Abstract For any pattern α of length at most two, we enumerate equivalence classes of Łukasiewicz paths of length n ≥ 0 where two paths are equivalent whenever the occurrence positions of α are identical on these paths. As a byproduct, we give a constructive bijection between Motzkin paths and some equivalence classes of Łukasiewicz paths.
Equivalence classes of permutations modulo descents and left-to-right maxima
2014
Abstract In a recent paper [2], the authors provide enumerating results for equivalence classes of permutations modulo excedances. In this paper we investigate two other equivalence relations based on descents and left-to-right maxima. Enumerating results are presented for permutations, involutions, derangements, cycles and permutations avoiding one pattern of length three.
Ordering and Convex Polyominoes
2005
We introduce a partial order on pictures (matrices), denoted by ≼ that extends to two dimensions the subword ordering on words. We investigate properties of special families of discrete sets (corresponding to {0,1}-matrices) with respect to this partial order. In particular we consider the families of polyominoes and convex polyominoes and the family, recently introduced by the authors, of L-convex polyominoes. In the first part of the paper we study the closure properties of such families with respect to the order. In particular we obtain a new characterization of L-convex polyominoes: a discrete set P is a L-convex polyomino if and only if all the elements Q≼P are polyominoes. In the seco…
Reconstruction of L-convex Polyominoes.
2003
Abstract We introduce the family of L-convex polyominoes, a subset of convex polyominoes whose elements satisfy a special convexity property. We develop an algorithm that reconstructs an L-convex polyomino from the set of its maximal L-polyominoes.
The Bishop–Phelps–Bollobás property for operators from c0 into some Banach spaces
2017
Abstract We exhibit a new class of Banach spaces Y such that the pair ( c 0 , Y ) has the Bishop–Phelps–Bollobas property for operators. This class contains uniformly convex Banach spaces and spaces with the property β of Lindenstrauss. We also provide new examples of spaces in this class.
On generalized a-Browder's theorem
2007
We characterize the bounded linear operators T satisfying generalized a-Browder's theorem, or generalized a-Weyl's theorem, by means of localized SVEP, as well as by means of the quasi-nilpotent part H0(�I T) asbelongs to certain sets of C. In the last part we give a general framework in which generalized a-Weyl's theorem follows for several classes of operators. 1. Preliminaries. Let L(X) denote the space of bounded linear oper- ators on an infinite-dimensional complex Banach space X. For T ∈ L(X), denote by α(T) the dimension of the kernel ker T, and by β(T) the codi- mension of the range T(X). The operator T ∈ L(X) is called upper semi- Fredholm if α(T) < ∞ and T(X) is closed, and lower …
A multilinear Phelps' Lemma
2007
We prove a multilinear version of Phelps' Lemma: if the zero sets of multilinear forms of norm one are 'close', then so are the multilinear forms.
Rearrangement and convergence in spaces of measurable functions
2007
We prove that the convergence of a sequence of functions in the space of measurable functions, with respect to the topology of convergence in measure, implies the convergence -almost everywhere ( denotes the Lebesgue measure) of the sequence of rearrangements. We obtain nonexpansivity of rearrangement on the space , and also on Orlicz spaces with respect to a finitely additive extended real-valued set function. In the space and in the space , of finite elements of an Orlicz space of a -additive set function, we introduce some parameters which estimate the Hausdorff measure of noncompactness. We obtain some relations involving these parameters when passing from a bounded set of , or , to th…
P-matrix completions under weak symmetry assumptions
2000
An n-by-n matrix is called a Π-matrix if it is one of (weakly) sign-symmetric, positive, nonnegative P-matrix, (weakly) sign-symmetric, positive, nonnegative P0,1-matrix, or Fischer, or Koteljanskii matrix. In this paper, we are interested in Π-matrix completion problems, that is, when a partial Π-matrix has a Π-matrix completion. Here, we prove that a combinatorially symmetric partial positive P-matrix has a positive P-matrix completion if the graph of its specified entries is an n-cycle. In general, a combinatorially symmetric partial Π-matrix has a Π-matrix completion if the graph of its specified entries is a 1-chordal graph. This condition is also necessary for (weakly) sign-symmetric …