Algebraic-geometry codes, one-point codes, and evaluation codes

One-point codes are those algebraic-geometry codes for which the associated divisor is a non-negative multiple of a single point. Evaluation codes were defined in order to give an algebraic generalization of both one-point algebraic-geometry codes and Reed–Muller codes. Given an -algebra A, an order function on A and given a surjective -morphism of algebras , the ith evaluation code with respect to is defined as the code . In this work it is shown that under a certain hypothesis on the -algebra A, not only any evaluation code is a one-point code, but any sequence of evaluation codes is a sequence of one-point codes. This hypothesis on A is that its field of fractions is a function field over and that A is integrally closed. Moreover, we see that a sequence of algebraic-geometry codes G _i with associated divisors is the sequence of evaluation codes associated to some -algebra A, some order function and some surjective morphism with if and only if it is a sequence of one-point codes.      

Codes defined by forms of degree 2 on non-degenerate Hermitian varieties in $${\mathbb{P}^{4}(\mathbb{F}_q)}$$

We study the functional codes of second order on a non-degenerate Hermitian variety as defined by G. Lachaud. We provide the best possible bounds for the number of points of quadratic sections of . We list the first five weights, describe the corresponding codewords and compute their number. The paper ends with two conjectures. The first is about minimum distance of the functional codes of order h on a non-singular Hermitian variety . The second is about distribution of the codewords of first five weights of the functional codes of second order on a non-singular Hermitian variety .      

Paley type partial difference sets in non <Emphasis Type="Italic">p</Emphasis>-groups

By modifying a construction for Hadamard (Menon) difference sets we construct two infinite families of negative Latin square type partial difference sets in groups of the form where p is any odd prime. One of these families has the well-known Paley parameters, which had previously only been constructed in p-groups. This provides new constructions of Hadamard matrices and implies the existence of many new strongly regular graphs including some that are conference graphs. As a corollary, we are able to construct Paley–Hadamard difference sets of the Stanton-Sprott family in groups of the form when is a prime power. These are new parameters for such difference sets.      

Maximum distance separable poset codes

We derive the Singleton bound for poset codes and define the MDS poset codes as linear codes which attain the Singleton bound. In this paper, we study the basic properties of MDS poset codes. First, we introduce the concept of I-perfect codes and describe the MDS poset codes in terms of I-perfect codes. Next, we study the weight distribution of an MDS poset code and show that the weight distribution of an MDS poset code is completely determined. Finally, we prove the duality theorem which states that a linear code C is an MDS -code if and only if is an MDS -code, where is the dual code of C and is the dual poset of      

G-Perfect nonlinear functions

Perfect nonlinear functions are used to construct DES-like cryptosystems that are resistant to differential attacks. We present generalized DES-like cryptosystems where the XOR operation is replaced by a general group action. The new cryptosystems, when combined with G-perfect nonlinear functions (similar to classical perfect nonlinear functions with one XOR replaced by a general group action), allow us to construct systems resistant to modified differential attacks. The more general setting enables robust cryptosystems with parameters that would not be possible in the classical setting. We construct several examples of G-perfect nonlinear functions, both -valued and -valued. Our final constructions demonstrate G-perfect nonlinear planar permutations (from to itself), thus providing an alternative implementation to current uses of almost perfect nonlinear functions.      

Projective curves of degree=codimension+2

In this article we study nondegenerate projective curves of degree d which are not arithmetically Cohen-Macaulay. Note that for a rational normal curve and a point . Our main result is about the relation between the geometric properties of X and the position of P with respect to . We show that the graded Betti numbers of X are uniquely determined by the rank of P with respect to . In particular, X satisfies property N _2,p if and only if . Therefore property N _2,p of X is controlled by and conversely can be read off from the minimal free resolution of X. This result provides a non-linearly normal example for which the converse to Theorem 1.1 in (Eisenbud et al., Compositio Math 141:1460–1478, 2005) holds. Also our result implies that for nondegenerate projective curves of degree d which are not arithmetically Cohen–Macaulay, there are exactly distinct Betti tables.     

Cyclicity of bicyclic operators and completeness of translates

We study cyclicity of operators on a separable Banach space which admit a bicyclic vector such that the norms of its images under the iterates of the operator satisfy certain growth conditions. A simple consequence of our main result is that a bicyclic unitary operator on a Banach space with separable dual is cyclic. Our results also imply that if is the shift operator acting on the weighted space of sequences , if the weight ω satisfies some regularity conditions and ω(n) = 1 for nonnegative n, then S is cyclic if . On the other hand one can see that S is not cyclic if the series diverges. We show that the question of Herrero whether either S or S* is cyclic on admits a positive answer when the series is convergent. We also prove completeness results for translates in certain Banach spaces of functions on .     

A Slow Transient Diffusion in a Drifted Stable Potential

We consider a diffusion process X in a random potential of the form , where is a positive drift and is a strictly stable process of index with positive jumps. Then the diffusion is transient and converges in law towards an exponential distribution. This behaviour contrasts with the case where is a drifted Brownian motion and provides an example of a transient diffusion in a random potential which is as “slow” as in the recurrent setting.      

On tight projective designs

It is shown that among all tight designs in , where is or , or (quaternions), only 5-designs in (Lyubich, Shatalora Geom Dedicata 86: 169–178, 2001) have irrational angle set. This is the only case of equal ranks of the first and the last irreducible idempotent in the corresponding Bose-Mesner algebra.      

Dy namic of Abelia n Subgroups of GL( n, $$\mathbb{C}$$): A Structure Theorem

In this paper, we characterize the dynamic of every Abelian subgroups of , or . We show that there exists a -invariant, dense open set U in saturated by minimal orbits with a union of at most n -invariant vector subspaces of of dimension n−1 or n−2 over . As a consequence, has height at most n and in particular it admits a minimal set in . This work is supported by the research unit: systèmes dynamiques et combinatoire: 99UR15-15     

Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three

A conflict-avoiding code (CAC) C of length n and weight k is a collection of k-subsets of such that holds for any , , where . A CAC with maximum code size for given n and k is called optimal. Furthermore, an optimal CAC C is said to be tight equi-difference if holds and any codeword has the form . The concept of a CAC is motivated from applications in multiple-access communication systems. In this paper, we give a necessary and sufficient condition to construct tight equi-difference CACs of weight k = 3 and characterize the code length n’s admitting the condition through a number theoretical approach.      

On the Hughes–Kleinfeld and Knuth’s semifields two-dimensional over a weak nucleus

In 1960 Hughes and Kleinfeld (Am J Math 82:389–392, 1960) constructed a finite semifield which is two-dimensional over a weak nucleus, given an automorphism σ of a finite field and elements with the property that has no roots in . In 1965 Knuth (J Algebra 2:182–217, 1965) constructed a further three finite semifields which are also two-dimensional over a weak nucleus, given the same parameter set . Moreover, in the same article, Knuth describes operations that allow one to obtain up to six semifields from a given semifield. We show how these operations in fact relate these four finite semifields, for a fixed parameter set, and yield at most five non-isotopic semifields out of a possible 24. These five semifields form two sets of semifields, one of which consists of at most two non-isotopic semifields related by Knuth operations and the other of which consists of at most three non-isotopic semifields.      

Non-free isometric immersions of Riemannian manifolds

Let (V, g) be a Riemannian manifold and let be the isometric immersion operator which, to a map , associates the induced metric on V, where denotes the Euclidean scalar product in . By Nash–Gromov implicit function theorem is infinitesimally invertible over the space of free maps. In this paper we study non-free isometric immersions . We show that the operator (where denotes the space of C ^∞- smooth quadratic forms on ) is infinitesimally invertible over a non-empty open subset of and therefore is an open map in the respective fine topologies.      

Increasing functions and inverse Santaló inequality for unconditional functions

Let be a convex function and be its Legendre tranform. It is proved that if is invariant by changes of signs, then . This is a functional version of the inverse Santaló inequality for unconditional convex bodies due to J. Saint Raymond. The proof involves a general result on increasing functions on together with a functional form of Lozanovskii’s lemma. In the last section, we prove that for some c > 0, one has always . This generalizes a result of B. Klartag and V. Milman.      

The cylinder over the Koras–Russell cubic threefold has a trivial Makar-Limanov invariant

In 1996 Makar-Limanov established that the Koras–Russell cubic threefold

Multiplicative Difference Sets via Additive Characters

We use Fourier analysis on the additive group of to give an alternative proof of the recent theorem of Maschietti and to prove recent conjectures of No, Chung and Yun and No, Golomb, Gong, Lee and Gaal on difference sets in the multiplicative group of , m odd. Along the ay e prove a stronger form of a celebrated theorem of Welch on the 3-valued cross-correlation of maximal length sequences.     

Derived McKay correspondence via pure-sheaf transforms

In most cases where it has been shown to exist the derived McKay correspondence can be written as a Fourier–Mukai transform which sends point sheaves of the crepant resolution Y to pure sheaves in . We give a sufficient condition for to be the defining object of such a transform. We use it to construct the first example of the derived McKay correspondence for a non-projective crepant resolution of . Along the way we extract more geometrical meaning out of the Intersection Theorem and learn to compute θ-stable families of G-constellations and their direct transforms.     

Probabilistic algorithm for finding roots of linearized polynomials

A probabilistic algorithm is presented for finding a basis of the root space of a linearized polynomial