<--- Back to Details
First PageDocument Content
Polynomials / Algebra / Permutation polynomial / Permutations / Permutation / Trinomial / Finite field / Binomial / Combinatorics
Date: 2013-08-27 15:36:00
Polynomials
Algebra
Permutation polynomial
Permutations
Permutation
Trinomial
Finite field
Binomial
Combinatorics

New Permutation Binomials and Trinomials over Finite Fields Xiang-dong Hou Department of Mathematics and Statistics University of South Florida

Add to Reading List

Source URL: www.math.uni-magdeburg.de

Download Document from Source Website

File Size: 436,67 KB

Share Document on Facebook

Similar Documents

Swiss-Cheese operad and Drinfeld center Najib Idrissi∗ January 5, 2017 We build a model in groupoids for the Swiss-Cheese operad, based on parenthesized permutations and braids. We relate algebras over this model

Swiss-Cheese operad and Drinfeld center Najib Idrissi∗ January 5, 2017 We build a model in groupoids for the Swiss-Cheese operad, based on parenthesized permutations and braids. We relate algebras over this model

DocID: 1xTp6 - View Document

Round-Optimal Secure Two-Party Computation from Trapdoor Permutations Michele Ciampi DIEM Università di Salerno ITALY

Round-Optimal Secure Two-Party Computation from Trapdoor Permutations Michele Ciampi DIEM Università di Salerno ITALY

DocID: 1vhtk - View Document

Algorithmics of Modular decomposition Christophe Paul CNRS - LIRMM, Montpellier France  Algorithms & Permutations Workshop

Algorithmics of Modular decomposition Christophe Paul CNRS - LIRMM, Montpellier France Algorithms & Permutations Workshop

DocID: 1v91l - View Document

A comment on Intersecting Families of Permutations Yuval Filmus July 3, 2017 Abstract Ellis, Friedgut and Pilpel [EFP11] prove that for large enough n, a t-intersecting family of permutations contains at most (n − t)!

A comment on Intersecting Families of Permutations Yuval Filmus July 3, 2017 Abstract Ellis, Friedgut and Pilpel [EFP11] prove that for large enough n, a t-intersecting family of permutations contains at most (n − t)!

DocID: 1uX0H - View Document

Sorting and a Tale of Two Polytopes Jean Cardinal ULB, Brussels, Belgium Algorithms & Permutations, Paris, 2012

Sorting and a Tale of Two Polytopes Jean Cardinal ULB, Brussels, Belgium Algorithms & Permutations, Paris, 2012

DocID: 1uPKr - View Document