Almost t-complementary uniform hypergraphs
Sign Up to like & getrecommendations! Published in 2019 at "Aequationes mathematicae"
DOI: 10.1007/s00010-018-0631-y
Abstract: An almost t-complementary k-hypergraph is a k-uniform hypergraph with vertex set V and edge set E for which there exists a permutation $$\theta \in Sym(V)$$θ∈Sym(V) such that the sets $$E, E^\theta , E^{\theta ^2}, \ldots… read more here.
Keywords: uniform hypergraphs; almost complementary; permutation; complementary uniform ... See more keywords
Resolutions by permutation modules
Sign Up to like & getrecommendations! Published in 2020 at "Archiv der Mathematik"
DOI: 10.1007/s00013-020-01493-w
Abstract: We prove that, up to adding a complement, every modular representation of a finite group admits a finite resolution by permutation modules. read more here.
Keywords: permutation modules; permutation; resolutions permutation;
Permutation Symmetric Hypergraph States and Multipartite Quantum Entanglement
Sign Up to like & getrecommendations! Published in 2019 at "International Journal of Theoretical Physics"
DOI: 10.1007/s10773-019-04259-5
Abstract: We demonstrate that a quantum hypergraph state is k-separable if and only if the hypergraph has k-connected components. The permutation symmetric states remains invariant under any permutation. We introduce permutation symmetric states generated by hypergraphs… read more here.
Keywords: permutation; hypergraph states; entanglement permutation; symmetric hypergraph ... See more keywords
Efficient cryptosystem approaches: S-boxes and permutation–substitution-based encryption
Sign Up to like & getrecommendations! Published in 2017 at "Nonlinear Dynamics"
DOI: 10.1007/s11071-016-3046-0
Abstract: In this paper, two efficient cryptosystem schemes in the form of permutation–substitution based on chaotic systems are proposed. Firstly, a simple and efficient S-box method is introduced in order to use this S-box designed scheme… read more here.
Keywords: permutation substitution; substitution based; permutation; efficient cryptosystem ... See more keywords
Cryptanalysis and improvement in a chaotic image cipher using two-round permutation and diffusion
Sign Up to like & getrecommendations! Published in 2019 at "Nonlinear Dynamics"
DOI: 10.1007/s11071-019-04771-7
Abstract: Cryptanalysis is significant for the design of secure image cryptosystem. Recently, a chaotic image encryption scheme using two rounds of Latin square-based permutation and diffusion was proposed. Although two-round encryption is used, the cryptosystem has… read more here.
Keywords: two round; permutation diffusion; diffusion; using two ... See more keywords
A simple method to determine the number of true different quadratic and cubic permutation polynomial based interleavers for turbo codes
Sign Up to like & getrecommendations! Published in 2017 at "Telecommunication Systems"
DOI: 10.1007/s11235-016-0166-2
Abstract: Interleavers are important blocks of the turbo codes, their types and dimensions having a significant influence on the performances of the mentioned codes. If appropriately chosen, the permutation polynomial (PP) based interleavers lead to remarkable… read more here.
Keywords: based interleavers; permutation; turbo codes; polynomial based ... See more keywords
Game theory-based integration of scheduling with flexible and periodic maintenance planning in the permutation flowshop sequencing problem
Sign Up to like & getrecommendations! Published in 2018 at "Operational Research"
DOI: 10.1007/s12351-016-0261-x
Abstract: We introduce a novel game theory approach to the problem of integrating periodic and flexible preventive maintenance and production scheduling for permutation flowshops. Our main contribution is to propose game modeling that allows decision maker… read more here.
Keywords: game; permutation; maintenance; game theory ... See more keywords
Block decomposition and statistics arising from permutation tableaux
Sign Up to like & getrecommendations! Published in 2022 at "European Journal of Combinatorics"
DOI: 10.1016/j.ejc.2021.103419
Abstract: Permutation statistics wm and rlm are both arising from permutation tableaux. wm was introduced by Chen and Zhou, which was proved equally distributed with the number of unrestricted rows of a permutation tableau. While rlm… read more here.
Keywords: block decomposition; permutation; equally distributed; permutation tableaux ... See more keywords
A new improved NEH heuristic for permutation flowshop scheduling problems
Sign Up to like & getrecommendations! Published in 2017 at "International Journal of Production Economics"
DOI: 10.1016/j.ijpe.2017.06.026
Abstract: Abstract Job evaluation and differentiation are crucial in scheduling. Since jobs can be represented by vectors of processing times, the average, standard deviation, and skewness of job processing times can be defined as the moments… read more here.
Keywords: improved neh; permutation; scheduling problems; new improved ... See more keywords
Characters of finite permutation groups and Krein parameters
Sign Up to like & getrecommendations! Published in 2018 at "Journal of Algebra"
DOI: 10.1016/j.jalgebra.2018.07.039
Abstract: Abstract Let G be a transitive permutation group on a finite set Ω. If G is multiplicity-free, then End G ( C [ Ω ] ) is commutative, and Krein parameters q i , j… read more here.
Keywords: finite permutation; characters finite; permutation groups; permutation ... See more keywords
The Benson - Symonds invariant for ordinary and signed permutation modules
Sign Up to like & getrecommendations! Published in 2021 at "Journal of Algebra"
DOI: 10.1016/j.jalgebra.2021.06.022
Abstract: Abstract The signed permutation modules are a simultaneous generalization of the ordinary permutation modules and the twisted permutation modules of the symmetric group. In a recent paper Dave Benson and Peter Symonds defined a new… read more here.
Keywords: signed permutation; permutation modules; invariant ordinary; permutation ... See more keywords