The Structure of Permutation Classes
نویسندگان
چکیده
Please note that organizational endorsement and approval is not required before the deadline because of the way the electronic system obtains the endorsement. Organizational endorsement is obtained in the following way: an e-mail with a secured link to your proposal will be sent to the e-mail address that you provided for your SPO officer. The secured link will allow your SPO officer to view your entire proposal and provide approval (if there is a problem and approval is not given, then you will be notified and allowed to make the necessary changes).
منابع مشابه
Juxtaposing Catalan Permutation Classes with Monotone Ones
This talk describes a clean and unified way to enumerate all juxtaposition classes of the form “Av(abc) next to Av(xy)”, where abc is a permutation of length three and xy is a permutation of length two. The main tools are Dyck paths, decorated by sequences of points, and context free grammars, used afterwards to enumerate these decorated Dyck paths. Juxtapositions are a simple special case of p...
متن کاملMILP models and valid inequalities for the two-machine permutation flowshop scheduling problem with minimal time lags
In this paper, we consider the problem of scheduling on two-machine permutation flowshop with minimal time lags between consecutive operations of each job. The aim is to find a feasible schedule that minimizes the total tardiness. This problem is known to be NP-hard in the strong sense. We propose two mixed-integer linear programming (MILP) models and two types of valid inequalities which aim t...
متن کاملArtemia: a family of provably secure authenticated encryption schemes
Authenticated encryption schemes establish both privacy and authenticity. This paper specifies a family of the dedicated authenticated encryption schemes, Artemia. It is an online nonce-based authenticated encryption scheme which supports the associated data. Artemia uses the permutation based mode, JHAE, that is provably secure in the ideal permutation model. The scheme does not require the in...
متن کاملSecurity of Sponge structures
Sponge structure is a structure widely used in the design of cryptographic algorithms that reduces the design of the algorithms to the design of a permutation or pseudo-random function. The development of sponge-based algorithms and the selection of designs based on this structure in SHA3 and CAESAR competitions increase the need to examine its security against various types of attacks. In the ...
متن کاملThe remoteness of the permutation code of the group $U_{6n}$
Recently, a new parameter of a code, referred to as the remoteness, has been introduced.This parameter can be viewed as a dual to the covering radius. It is exactly determined for the cyclic and dihedral groups. In this paper, we consider the group $U_{6n}$ as a subgroup of $S_{2n+3}$ and obtain its remoteness. We show that the remoteness of the permutation code $U_{6n}$ is $2n+2$. Moreover, ...
متن کاملOn the Mark and Markaracter Tables of Finite Groups
Let G be a finite group and C(G) be the family of representative conjugacy classes of subgroups of G. The matrix whose H,K-entry is the number of fixed points of the set G/K under the action of H is called the table of marks of G where H,K run through all elements in C(G). Shinsaku Fujita for the first time introduced the term “markaracter” to discuss marks for permutation representati...
متن کامل