Results 1  10
of
3,663
COMBINATORIAL PROPERTIES OF STURMIAN PALINDROMES
 INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE
"... We study some structural and combinatorial properties of Sturmian palindromes, i.e., palindromic finite factors of Sturmian words. In particular, we give a formula which permits to compute in an exact way the number of Sturmian palindromes of any length. Moreover, an interesting characterization of ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
We study some structural and combinatorial properties of Sturmian palindromes, i.e., palindromic finite factors of Sturmian words. In particular, we give a formula which permits to compute in an exact way the number of Sturmian palindromes of any length. Moreover, an interesting characterization
Some Combinatorial Properties of Schubert Polynomials
, 1993
"... Schubert polynomials were introduced by Bernstein Gelfand Gelfand and De mazure, and were extensively developed by Lascoux, Schiitzenberger, Macdonald, and others. We give an explicit combinatorial interpretation of the Schubert polyno mial in terms of the reduced decompositions of the permutation ..."
Abstract

Cited by 158 (11 self)
 Add to MetaCart
Schubert polynomials were introduced by Bernstein Gelfand Gelfand and De mazure, and were extensively developed by Lascoux, Schiitzenberger, Macdonald, and others. We give an explicit combinatorial interpretation of the Schubert polyno mial in terms of the reduced decompositions
Combinatorial Properties of Frameproof and Traceability Codes
 IEEE Transactions on Information Theory
, 2000
"... In order to protect copyrighted material, codes may be embedded in the content or codes may be associated with the keys used to recover the content. Codes can oer protection by providing some form of traceability for pirated data. Several researchers have studied dierent notions of traceability a ..."
Abstract

Cited by 71 (8 self)
 Add to MetaCart
be formulated as codes having certain combinatorial properties. In this paper, we study the relationships between the various notions, and we discuss equivalent formulations using structures such as perfect hash families. We use methods from combinatorics and coding theory to provide bounds (necessary
Combinatorial Property Testing (a survey)
 In: Randomization Methods in Algorithm Design
, 1998
"... We consider the question of determining whether a given object has a predetermined property or is "far" from any object having the property. Specifically, objects are modeled by functions, and distance between functions is measured as the fraction of the domain on which the functions diffe ..."
Abstract

Cited by 52 (2 self)
 Add to MetaCart
differ. We consider (randomized) algorithms which may query the function at arguments of their choice, and seek algorithms which query the function at relatively few places. We focus on combinatorial properties, and specifically on graph properties. The two standard representations of graphs
Combinatorial Properties and Characterization of Glued Semigroups
"... This work focuses on the combinatorial properties of glued semigroups and provides its combinatorial characterization. Some classical results for affine glued semigroups are generalized and some methods to obtain glued semigroups are developed. ..."
Abstract
 Add to MetaCart
This work focuses on the combinatorial properties of glued semigroups and provides its combinatorial characterization. Some classical results for affine glued semigroups are generalized and some methods to obtain glued semigroups are developed.
Combinatorial properties of Hechler forcing
 Annals of Pure and Applied Logic
, 1992
"... 477 revision:19930912 modified:19930912 Using a notion of rank for Hechler forcing we show: 1) assuming ω V 1 = ω L 1, there is no real in V [d] which is eventually different from the reals in L[d], where d is Hechler over V; 2) adding one Hechler real makes the invariants on the lefthand side ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
477 revision:19930912 modified:19930912 Using a notion of rank for Hechler forcing we show: 1) assuming ω V 1 = ω L 1, there is no real in V [d] which is eventually different from the reals in L[d], where d is Hechler over V; 2) adding one Hechler real makes the invariants on the lefthand side of Cichoń’s diagram equal ω1 and those on the righthand side equal 2 ω and produces a maximal almost disjoint family of subsets of ω of size ω1; 3) there is no perfect set of random reals over V in V [r][d], where r is random over V and d Hechler over V [r], thus answering a question of the first and second authors.
Combinatorial properties of permutation tableaux
, 2007
"... We give another construction of a permutation tableau from its corresponding permutation and construct a permutationpreserving bijection between 1hinge and 0hinge tableaux. We also consider certain alignment and crossing statistics on permutation tableaux that are known to be equidistributed via ..."
Abstract
 Add to MetaCart
We give another construction of a permutation tableau from its corresponding permutation and construct a permutationpreserving bijection between 1hinge and 0hinge tableaux. We also consider certain alignment and crossing statistics on permutation tableaux that are known to be equidistributed via a complicated map to permutations that translates those to occurrences of certain patterns. We give two direct maps on tableaux that proves the equidistribution of those statistics by exchanging some statistics and preserving the rest. Finally, we enumerate some sets of permutations that are restricted both by pattern avoidance and by certain parameters of their associated permutation tableaux.
Results 1  10
of
3,663