Zobrazeno 1 - 10
of 611
pro vyhledávání: '"Generalized permutation matrix"'
Publikováno v:
Theoretical Computer Science. 710:35-43
Given a text T of length n and a pattern P of length m over a numeric alphabet Σ, the boxed-mesh permutation pattern matching problem is to find all boxed-subsequences of T whose relative order between all characters is the same as that of P. In thi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::48e5d5a4f0c8a4a240c765996c584467
https://doi.org/10.1016/j.tcs.2017.02.022
https://doi.org/10.1016/j.tcs.2017.02.022
Publikováno v:
Finite Fields and Their Applications. 49:212-226
Six classes of permutation pentanomials are constructed from fractional polynomials which permute the set of ( 2 m + 1 ) -th roots of unity. Based on an approach which is a generalization of the work of Zha, Hu and Fan, some permutation pentanomials
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dca1156040f3bfae6f5991028d16ebd9
https://doi.org/10.1016/j.ffa.2017.10.005
https://doi.org/10.1016/j.ffa.2017.10.005
Publikováno v:
SIAM Journal on Discrete Mathematics. 32:1721-1740
Let $G =\langle S\rangle$ be a solvable permutation group given as input by the generating set $S$, that is, $G$ is a solvable subgroup of the symmetric group $S_n$. We give a deterministic polynom...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ae32478584429032253cb883529d7876
https://doi.org/10.1137/17m1148979
https://doi.org/10.1137/17m1148979
Autor:
Jingxue Ma, Gennian Ge
Publikováno v:
Finite Fields and Their Applications. 48:261-270
Permutation polynomials over finite fields constitute an active research area and have applications in many areas of science and engineering. In this paper, two conjectures on permutation polynomials proposed recently by Wu and Li [19] are settled. M
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1abf83459b9e21724f26e0385e7d85ca
https://doi.org/10.1016/j.ffa.2017.08.003
https://doi.org/10.1016/j.ffa.2017.08.003
Autor:
Nian Li
Publikováno v:
Finite Fields and Their Applications. 47:1-10
Permutation polynomials with a few terms attract researchers' interest in recent years due to their simple algebraic form and some additional extraordinary properties. In this paper, by analyzing the quadratic factors of a fifth-degree polynomial and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::859a344e2e17c8b464638f75990207b9
https://doi.org/10.1016/j.ffa.2017.05.003
https://doi.org/10.1016/j.ffa.2017.05.003
Publikováno v:
Linear and Multilinear Algebra. 66:1362-1379
To generalize D-nilpotent matrices that play a role in study of Druzkowski maps, we introduce quasi-D-nilpotent matrices. A matrix A is called quasi-D-nilpotent if there exists a subspace V of diagonal matrices of codimension 1 such that DA is nilpot
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6797e8c975e4c4769d1621466343b02a
https://doi.org/10.1080/03081087.2017.1354971
https://doi.org/10.1080/03081087.2017.1354971
Publikováno v:
Finite Fields and Their Applications. 46:38-56
Permutation polynomials are an interesting subject of mathematics and have applications in other areas of mathematics and engineering. In this paper, we determine all permutation trinomials over F 2 m in Zieve's paper [30] . We prove a conjecture pro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cea29c8f76dcbe766f98ed907441fb4c
https://doi.org/10.1016/j.ffa.2017.03.002
https://doi.org/10.1016/j.ffa.2017.03.002
Autor:
Vikraman Arvind
Publikováno v:
Theoretical Computer Science. 687:70-78
In this paper we study the parameterized complexity of two well-known permutation group problems which are NP-complete. 1. Given a permutation group G = 〈 S 〉 ≤ S n and a parameter k, find a permutation π ∈ G such that | { i ∈ [ n ] | π (
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bf6c8ed44153c2cd01b0e670b0b651ef
https://doi.org/10.1016/j.tcs.2017.05.007
https://doi.org/10.1016/j.tcs.2017.05.007
Autor:
Lei Zhang, Wenling Wu
Publikováno v:
IET Information Security. 11:121-128
Since the proposition of improved generalised Feistel structure (GFS), many researches and applications have been published. In this study, the authors further enhance the improved GFS with SP-type round function by extending the sub-block-wise permu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f16dd61a2d50293d96db4ebad6b8e60b
https://doi.org/10.1049/iet-ifs.2015.0433
https://doi.org/10.1049/iet-ifs.2015.0433
Autor:
Mikhail N. Vyalyi, A. V. Babenko
Publikováno v:
Computational Mathematics and Mathematical Physics. 57:362-371
The problem of linear classification of the parity of permutation matrices is studied. This problem is related to the analysis of complexity of a class of algorithms designed for computing the permanent of a matrix that generalizes the Kasteleyn algo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5b4000414b527fd98d4ad551e4837f56
https://doi.org/10.1134/s0965542517020038
https://doi.org/10.1134/s0965542517020038