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

642 (0,098s)

Result

Computation with permutations in introductory algebra.

Various aspects of introductory permutation topic are discussed, esp. practice of permutation algebra in high school courses. The central notion is cycle. Powers of permutations with big exponents are evaluated by means of ...

BA - Obecná matematika

  • 2003
  • D
Result

A Common Generalization of Permutability and 0-permutability

We present a congruence property which is a common generalization of congruence permutability and 0-permutability. We characterize varieties of algebras satisfying this property by a Mal'cev type condition as well as by a relational...

BA - Obecná matematika

  • 2001
  • Jx
Result

Hardness of permutation pattern matching

We show that permutation pattern matching of a permutation pi in a permutation tau is NP-complete even when pi has no decreasing subsequence of length 3 and tau has no decreasing subsequence of length 4. We also show that t...

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

  • 2017
  • D
  • Link
Result

Lower bound on the size of a quasirandom forcing set of permutations

A set S of permutations is forcing if for any sequence {Pi_i} of permutations where the density d(pi, Pi_i) converges to 1/|pi|! for every permutation pi from S such that the set of all permutations of order k is f...

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

  • 2022
  • Jimp
  • Link
Result

Generalized Coloring of Permutations

A permutation $pi$ is a emph{merge} of a permutation $sigma$ and a permutation, for fixed hereditary permutation classes $cC$ and $cD$, the complexity of determining whether a given permutation $pi$ is a m...

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

  • 2018
  • D
  • Link
Result

Generalized Coloring of Permutations

A permutation p is a merge of a permutation q and a permutation r, if we can order as q and the blue ones as r. We consider, for fixed hereditary permutation classes C and D, the complexity of determining whether a...

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

  • 2024
  • Jimp
  • Link
Result

Cyclic Permutation Viewer 1.0

Cyclic Permutation Viewer is software for cyclic permutaion analysis and creating its images. Application can plot permutation's connection image. Images can be saved in BMP format....

BA - Obecná matematika

  • 2012
  • R
  • Link
Result

Linear-Time Ranking of Permutations

We present linear-time lexicographic ranking and unranking algorithms for permutations and k-permutations.

BA - Obecná matematika

  • 2007
  • D
Result

Density maximizers of layered permutations

A permutation is layered if it contains neither 231 nor 312 as a pattern. It is known that, if σ is a layered permutation, then the density of σ in a permutation of order n is maximized by a layered permutation. A...

Pure mathematics

  • 2022
  • Jimp
  • Link
Result

Pattern avoidance in partial permutations (extended abstract)

A partial permutation of length n with k holes is a sequence of symbols the remaining symbols are "holes". We define pattern-avoidance in partial permutations and prove that most of the previous results on Wilf equivalence of pe...

BA - Obecná matematika

  • 2010
  • D
  • 1 - 10 out of 642