All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Filters

34 352 (0,102s)

Result

New equivalences for pattern-avoiding involutions

In this paper, we study Wilf-type equivalences for pattern-avoiding involutions.

BA - Obecná matematika

  • 2009
  • Jx
Result

Dyck paths and pattern-avoiding matchings

We prove combinatorial identities between pattern-avoiding families of matchings.

BA - Obecná matematika

  • 2007
  • Jx
Result

On Pattern-Avoiding Partitions (article no. R39)

consider classes of partitions whose restricted-growth functions avoid a given patterns. Two patterns are considered equivalent, if there is a size-preserving bijection between the corresponding pattern-avoidi...

BA - Obecná matematika

  • 2008
  • Jx
Result

Pattern-Avoiding Binary Trees - Generation, Counting, and Bijections

In this paper we propose a notion of pattern avoidance in binary trees that generalizes the avoidance of contiguous tree patterns studied by Rowland and non that are characterized by avoiding one or more o...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2023
  • D
  • Link
Result

Pattern avoidance in partial permutations

We investigate the concept of pattern avoidance in partial permutations and prove several results extending known properties of Wilf equivalence......

BA - Obecná matematika

  • 2011
  • Jx
  • Link
Result

Combinatorial generation via permutation languages. VI. Binary trees

In this paper we propose a notion of pattern avoidance in binary trees that generalizes the avoidance of contiguous tree patterns studied by Rowland and non that are characterized by avoiding one or more o...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2024
  • Jimp
  • Link
Result

On multiple pattern avoiding set partitions

two distinct symbols and tau is an arbitrary pattern of size k that avoids sigmaWe study classes of set partitions determined by the avoidance of multiple patterns, applying a natural notion of partition containme...

BA - Obecná matematika

  • 2013
  • Jx
  • Link
Result

Matchings Avoiding Partial Patterns and Lattice Paths

thenumber of matchings whose representing sequence avoids the pattern 1123, as well as those avoiding the pattern 1132. We achieve the enumeration by constructing......

BA - Obecná matematika

  • 2006
  • Jx
Result

Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns

avoiding a pattern of a special form is a merge of two permutations, each of which avoids a smaller pattern. We also conjecture that, for any k, the set of 1324We prove that the Stanley-Wilf limit of any layered p...

BA - Obecná matematika

  • 2012
  • Jx
  • Link
Result

On the structure of matrices avoiding interval-minor patterns

We study the structure of 01-matrices avoiding a pattern P as an interval minor. We focus on critical P-avoiders, i.e., on the P-avoiding matrices in which result, we show that for every pattern P that has...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2018
  • Jimp
  • Link
  • 1 - 10 out of 34 352