Results 81 to 87 of about 143 (87)

The box parameter for words and permutations

Open Mathematics, 2014
Prodinger Helmut
doaj   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Short Block-Move–CPP is NP-Complete

Matemática Contemporânea, 2020
The Closest Object Problem aims to find one object in the center of all others. It was studied for strings with respect to the Hamming distance, where the Hamming Closest String Problem was settled to be NP-complete. The Closest Permutation Problem (CPP)
L. Cunha, Vinícius dos Santos, L. Kowada, Celina de Figueiredo   +3 more
semanticscholar   +1 more source

Encoding of partition set using sub-exceeding function

, 2018
We introduce in this paper a new method to encode all partitions of any set of n objects using sub-exceeding function. So, let n and k be two positive integers such that 1 ≤ k ≤ n and let too Ω a set of cardinal n.
Luc Rabefihavanana
semanticscholar   +1 more source

A Note on M-Operator Representation of q-Lattices

, 2015
The theory of q-lattices represents a natural generalization of the lattice theory. We provide a characterization of xed points of the socalled M-operators, representing a q-lattice theoretic analogy of closure operators.
R. Halaš, J. Pócs
semanticscholar   +1 more source

More Combinatorics of Fulton's Essential Set

, 2013
We develop combinatorics of Fulton’s essential set particularly with a connection to Baxter permutations. For this purpose, we introduce a new idea: dual essential sets.
Masato Kobayashi
semanticscholar   +1 more source

The Number Of Permutations Which Form Arithmetic Progressions Modulo m

, 2014
. We find a formula for the number of permutations of { 1 , 2 , . . . , n } which form arithmetic progressions modulo m . 05A05,
F. Luca, Augustine O. Munagi
semanticscholar   +1 more source

Some results on the (4) problem of Erdös and Hajnal

, 1995
A recursive computer program has shown that m(4) ≥ 20. Define m(4) to be the minimum number of 4-sets of an n-set neccessary to insure a 4-set of one color exists no matter how the points of the n-set are colored, using two colors, where n is allowed to ...
Greg Manning
semanticscholar   +1 more source