Zeszyty czasopisma

Tom 30 (2022): Zeszyt 2 (August 2022)

Tom 30 (2022): Zeszyt 1 (June 2022)

Tom 29 (2020): Zeszyt 1 (December 2020)

Tom 28 (2019): Zeszyt 1 (October 2019)

Tom 27 (2018): Zeszyt 2 (August 2018)

Tom 27 (2018): Zeszyt 1 (July 2018)

Tom 26 (2017): Zeszyt 1 (June 2017)

Tom 25 (2015): Zeszyt 2 (December 2015)

Tom 25 (2015): Zeszyt 1 (September 2015)

Informacje o czasopiśmie
Format
Czasopismo
eISSN
1788-800X
Pierwsze wydanie
30 Mar 2015
Częstotliwość wydawania
4 razy w roku
Języki
Angielski

Wyszukiwanie

Tom 26 (2017): Zeszyt 1 (June 2017)

Informacje o czasopiśmie
Format
Czasopismo
eISSN
1788-800X
Pierwsze wydanie
30 Mar 2015
Częstotliwość wydawania
4 razy w roku
Języki
Angielski

Wyszukiwanie

4 Artykułów
Otwarty dostęp

On permutations avoiding 1324, 2143, and another 4-letter pattern

Data publikacji: 14 Jul 2017
Zakres stron: 1 - 10

Abstrakt

Abstract

We enumerate permutations avoiding 1324, 2143, and a third 4-letter pattern τ a step toward the goal of enumerating avoiders for all triples of 4-letter patterns. The enumeration is already known for all but five patterns τ, which are treated in this paper.

Słowa kluczowe

  • pattern avoidance
Otwarty dostęp

On permutations avoiding 1243, 2134, and another 4-letter pattern

Data publikacji: 14 Jul 2017
Zakres stron: 11 - 21

Abstrakt

Abstract

We enumerate permutations avoiding 1243, 2134, and a third 4-letter pattern τ, a step toward the goal of enumerating avoiders for all triples of 4-letter patterns. The enumeration is already known for all but three patterns τ, which are treated in this paper.

Słowa kluczowe

  • pattern avoidance
Otwarty dostęp

Improvements to exact Boltzmann sampling using probabilistic divide-and-conquer and the recursive method

Data publikacji: 14 Jul 2017
Zakres stron: 22 - 45

Abstrakt

Abstract

We demonstrate an approach for exact sampling of certain discrete combinatorial distributions, which is a hybrid of exact Boltzmann sampling and the recursive method, using probabilistic divide-and-conquer (PDC). The approach specializes to exact Boltzmann sampling in the trivial setting, and specializes to PDC deterministic second half in the first non-trivial application. A large class of examples is given for which this method broadly applies, and several examples are worked out explicitly.

Słowa kluczowe

  • exact sampling
  • perfect simulation
  • probabilistic divide-and-conquer
  • Boltzmann sampler
  • random combinatorial structure
  • rejection sampling
  • recursive method
Otwarty dostęp

A characterization of regular, intra-regular, left quasi-regular and semisimple hypersemigroups in terms of fuzzy sets

Data publikacji: 14 Jul 2017
Zakres stron: 46 - 56

Abstrakt

Abstract

We prove that an hypersemigroup H is regular if and only, for any fuzzy subset f of H, we have f ≼ f ο 1 ο f and it is intra-regular if and only if, for any fuzzy subset f of H, we have f ≼1 ο f ο f ο 1. An hypersemigroup H is left (resp. right) quasi-regular if and only if, for any fuzzy subset f of H we have f ≼ 1 ο f ο 1 ο f (resp. f ≼ f ο 1 ο f ο 1) and it is semisimple if and only if, for any fuzzy subset f of H we have f ≼ 1 ο f ο 1 ο f ο 1. The characterization of regular and intra-regular hypersemigroups in terms of fuzzy subsets are very useful for applications.

Słowa kluczowe

  • hypersemigroup
  • fuzzy subset
  • regular
  • intra-regular
  • left quasi-regular
  • semisimple
4 Artykułów
Otwarty dostęp

On permutations avoiding 1324, 2143, and another 4-letter pattern

Data publikacji: 14 Jul 2017
Zakres stron: 1 - 10

Abstrakt

Abstract

We enumerate permutations avoiding 1324, 2143, and a third 4-letter pattern τ a step toward the goal of enumerating avoiders for all triples of 4-letter patterns. The enumeration is already known for all but five patterns τ, which are treated in this paper.

Słowa kluczowe

  • pattern avoidance
Otwarty dostęp

On permutations avoiding 1243, 2134, and another 4-letter pattern

Data publikacji: 14 Jul 2017
Zakres stron: 11 - 21

Abstrakt

Abstract

We enumerate permutations avoiding 1243, 2134, and a third 4-letter pattern τ, a step toward the goal of enumerating avoiders for all triples of 4-letter patterns. The enumeration is already known for all but three patterns τ, which are treated in this paper.

Słowa kluczowe

  • pattern avoidance
Otwarty dostęp

Improvements to exact Boltzmann sampling using probabilistic divide-and-conquer and the recursive method

Data publikacji: 14 Jul 2017
Zakres stron: 22 - 45

Abstrakt

Abstract

We demonstrate an approach for exact sampling of certain discrete combinatorial distributions, which is a hybrid of exact Boltzmann sampling and the recursive method, using probabilistic divide-and-conquer (PDC). The approach specializes to exact Boltzmann sampling in the trivial setting, and specializes to PDC deterministic second half in the first non-trivial application. A large class of examples is given for which this method broadly applies, and several examples are worked out explicitly.

Słowa kluczowe

  • exact sampling
  • perfect simulation
  • probabilistic divide-and-conquer
  • Boltzmann sampler
  • random combinatorial structure
  • rejection sampling
  • recursive method
Otwarty dostęp

A characterization of regular, intra-regular, left quasi-regular and semisimple hypersemigroups in terms of fuzzy sets

Data publikacji: 14 Jul 2017
Zakres stron: 46 - 56

Abstrakt

Abstract

We prove that an hypersemigroup H is regular if and only, for any fuzzy subset f of H, we have f ≼ f ο 1 ο f and it is intra-regular if and only if, for any fuzzy subset f of H, we have f ≼1 ο f ο f ο 1. An hypersemigroup H is left (resp. right) quasi-regular if and only if, for any fuzzy subset f of H we have f ≼ 1 ο f ο 1 ο f (resp. f ≼ f ο 1 ο f ο 1) and it is semisimple if and only if, for any fuzzy subset f of H we have f ≼ 1 ο f ο 1 ο f ο 1. The characterization of regular and intra-regular hypersemigroups in terms of fuzzy subsets are very useful for applications.

Słowa kluczowe

  • hypersemigroup
  • fuzzy subset
  • regular
  • intra-regular
  • left quasi-regular
  • semisimple

Zaplanuj zdalną konferencję ze Sciendo