Block-symmetric polynomials correlate with parity better than symmetric
نویسندگان
چکیده
منابع مشابه
Locally Parity-Time Symmetric and globally Parity-Symmetric systems
We introduce a new class of systems holding Parity Time (PT)-symmetry locally whereas being globally Psymmetric. The potential is globally symmetric, U=U(|r|), and fulfills PT-symmetry with respect to periodically distributed points r0: U(|r0+r|)=U*(|r0-r|) being r0∫ 0. We show that such systems hold novel properties arising from the merging of the two different symmetries, leading to a strong ...
متن کاملSymmetric Polynomials
f(T1, . . . , Tn) = f(Tσ(1), . . . , Tσ(n)) for all σ ∈ Sn. Example 1. The sum T1 + · · ·+ Tn and product T1 · · ·Tn are symmetric, as are the power sums T r 1 + · · ·+ T r n for any r ≥ 1. As a measure of how symmetric a polynomial is, we introduce an action of Sn on F [T1, . . . , Tn]: (σf)(T1, . . . , Tn) = f(Tσ−1(1), . . . , Tσ−1(n)). We need σ−1 rather than σ on the right side so this is a...
متن کاملParity-Based Concurrent Error Detection in Symmetric Block Ciphers
Deliberate injection of faults into cryptographic devices is an effective cryptanalysis technique against symmetric and asymmetric encryption. We will describe a general concurrent error detection (CED) approach against such attacks on symmetric block ciphers using CS-cipher as an example. The proposed CED compares a carefully modified parity of the input plain text with that of the output ciph...
متن کاملSymmetric Polynomials and Symmetric Mean Inequalities
We prove generalized arithmetic-geometric mean inequalities for quasi-means arising from symmetric polynomials. The inequalities are satisfied by all positive, homogeneous symmetric polynomials, as well as a certain family of nonhomogeneous polynomials; this family allows us to prove the following combinatorial result for marked square grids. Suppose that the cells of a n × n checkerboard are e...
متن کاملSymmetric and Non-symmetric Macdonald Polynomials
The symmetric Macdonald polynomials are able to be constructed out of the non-symmetric Macdonald polynomials. This allows us to develop the theory of the symmetric Macdonald polynomials by first developing the theory of their non-symmetric counterparts. In taking this approach we are able to obtain new results as well as simpler and more accessible derivations of some of the known fundamental ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: computational complexity
سال: 2017
ISSN: 1016-3328,1420-8954
DOI: 10.1007/s00037-017-0153-3