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.      

Rigidity and holomorphic Segre transversality for holomorphic Segre maps

Let and denote the complexifications of Heisenberg hypersurfaces in and , respectively. We show that non-degenerate holomorphic Segre mappings from into with possess a partial rigidity property. As an application, we prove that the holomorphic Segre non-transversality for a holomorphic Segre map from into with propagates along Segre varieties. We also give an example showing that this propagation property of holomorphic Segre transversality fails when N > 2n − 2.     

Nonlinear Parabolic Equations with Regularized Derivatives in Colombeau Algebra

We consider several types of nonlinear parabolic equations with singular like potential and initial data. To prove the existence-uniqueness theorems we employ regularized derivatives. As a framework we use Colombeau space and Colombeau vector space      

A note on <Emphasis Type="Italic">q</Emphasis>-multiplicative functions

We prove the following statement. Let , and let . Suppose that, for all and , the sequence satisfies the relation

On the minimality of the p-harmonic ma p $$x/\|x\|$$ for weighted energy

In this paper, we study the minimality of the map for the weighted energy functional , where is a continuous function. We prove that for any integer and any non-negative, non-decreasing continuous function f, the map minimizes E _f,p among the maps in which coincide with on . The case p = 1 has been already studied in [Bourgoin J.-C. Calc. Var. (to appear)]. Then, we extend results of Hong (see Ann. Inst. Poincaré Anal. Non-linéaire 17: 35–46 (2000)). Indeed, under the same assumptions for the function f, we prove that in dimension n ≥  7 for any real with , the map minimizes E _f,p among the maps in which coincide with on .      

Self-dual codes over \mathbb{Z}_8 and \mathbb{Z}_9

We study self-dual codes over the rings and . We define various weights and weight enumerators over these rings and describe the groups of invariants for each weight enumerator over the rings. We examine the torsion codes over these rings to describe the structure of self-dual codes. Finally we classify self-dual codes of small lengths over .     

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 .      

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      

Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits

Let p be a prime and let be an elliptic curve defined over the finite field of p elements. For a given point the linear congruential genarator on elliptic curves (EC-LCG) is a sequence (U _n ) of pseudorandom numbers defined by the relation: where denote the group operation in and is the initial value or seed. We show that if G and sufficiently many of the most significants bits of two consecutive values U _n , U _n+1 of the EC-LCG are given, one can recover the seed U ₀ (even in the case where the elliptic curve is private) provided that the former value U _n does not lie in a certain small subset of exceptional values. We also estimate limits of a heuristic approach for the case where G is also unknown. This suggests that for cryptographic applications EC-LCG should be used with great care. Our results are somewhat similar to those known for the linear and non-linear pseudorandom number congruential generator.      

Relaxation of an area-like functional for the function $$\frac{x}{|x|}$$

We compute the relaxation

Laguerre geometry of hypersurfaces in $$\mathbb{R}^{n}$$

Laguerre geometry of surfaces in is given in the book of Blaschke [Vorlesungen über Differentialgeometrie, Springer, Berlin Heidelberg New York (1929)], and has been studied by Musso and Nicolodi [Trans. Am. Math. soc. 348, 4321–4337 (1996); Abh. Math. Sem. Univ. Hamburg 69, 123–138 (1999); Int. J. Math. 11(7), 911–924 (2000)], Palmer [Remarks on a variation problem in Laguerre geometry. Rendiconti di Mathematica, Serie VII, Roma, vol. 19, pp. 281–293 (1999)] and other authors. In this paper we study Laguerre differential geometry of hypersurfaces in . For any umbilical free hypersurface with non-zero principal curvatures we define a Laguerre invariant metric g on M and a Laguerre invariant self-adjoint operator : TM → TM, and show that is a complete Laguerre invariant system for hypersurfaces in with n≥ 4. We calculate the Euler–Lagrange equation for the Laguerre volume functional of Laguerre metric by using Laguerre invariants. Using the Euclidean space , the semi-Euclidean space and the degenerate space we define three Laguerre space forms , and and define the Laguerre embeddings and , analogously to what happens in the Moebius geometry where we have Moebius space forms S ⁿ , and (spaces of constant curvature) and conformal embeddings and [cf. Liu et al. in Tohoku Math. J. 53, 553–569 (2001) and Wang in Manuscr. Math. 96, 517–534 (1998)]. Using these Laguerre embeddings we can unify the Laguerre geometry of hypersurfaces in , and . As an example we show that minimal surfaces in or are Laguerre minimal in .C. Wang Partially supported by RFDP and Chuang-Xin-Qun-Ti of NSFC.     

A note on simultaneous Diophantine approximation on planar curves

Let denote the set of simultaneously - approximable points in and denote the set of multiplicatively ψ-approximable points in . Let be a manifold in . The aim is to develop a metric theory for the sets and analogous to the classical theory in which is simply . In this note, we mainly restrict our attention to the case that is a planar curve . A complete Hausdorff dimension theory is established for the sets and . A divergent Khintchine type result is obtained for ; i.e. if a certain sum diverges then the one-dimensional Lebesgue measure on of is full. Furthermore, in the case that is a rational quadric the convergent Khintchine type result is obtained for both types of approximation. Our results for naturally generalize the dimension and Lebesgue measure statements of Beresnevich et al. (Mem AMS, 179 (846), 1–91 (2006)). Moreover, within the multiplicative framework, our results for constitute the first of their type. The research of Victor V. Beresnevich was supported by an EPSRC Grant R90727/01. Sanju L. Velani is a Royal Society University Research Fellow. For Iona and Ayesha on No. 3.     

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.      

Exact Distribution of the Local Score for Markovian Sequences

Let be a sequence of letters taken in a finite alphabet Θ. Let be a scoring function and the corresponding score sequence where X _i = s(A _i ). The local score is defined as follows: . We provide the exact distribution of the local score in random sequences in several models. We will first consider a Markov model on the score sequence , and then on the letter sequence . The exact P-value of the local score obtained with both models are compared thanks to several datasets. They are also compared with previous results using the independent model.     

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.      

Deep Matrix Algebras of Finite Type

Deep matrix algebras based on a set over a ring are introduced and studied by McCrimmon when has infinite cardinality. Here, we construct a new -module that is faithful for of any cardinality. For a field of arbitrary characteristic and , is studied in depth. The algebra is shown to possess a unique proper non-zero ideal, isomorphic to . This leads to a new and interesting simple algebra, , the quotient of by its unique ideal. Both and the quotient algebra are shown to have centers isomorphic to . Via the new faithful representation, all automorphisms of are shown to be inner in the sense of Definition 18.Presented by D. Passman.     

Quantization for a fourth order equation with critical exponential growth

For concentrating solutions weakly in H ²(Ω) to the equation on a domain with Navier boundary conditions the concentration energy is shown to be strictly quantized in multiples of the number .     

Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles

We find lower bounds on the minimum distance and characterize codewords of small weight in low-density parity check (LDPC) codes defined by (dual) classical generalized quadrangles. We analyze the geometry of the non-singular parabolic quadric in PG(4,q) to find information about the LDPC codes defined by Q (4,q), and . For , and , we are able to describe small weight codewords geometrically. For , q odd, and for , we improve the best known lower bounds on the minimum distance, again only using geometric arguments. Similar results are also presented for the LDPC codes LU(3,q) given in [Kim, (2004) IEEE Trans. Inform. Theory, Vol. 50: 2378–2388]     

A representation of bivariate extreme value distributions via norms on \mathbb{R}^{2}

It is known that a bivariate extreme value distribution (EVD) with reverse exponential margins can be represented as , , where is a suitable norm on . We prove in this paper the converse implication, i.e., given an arbitrary norm on , , , defines an EVD with reverse exponential margins, if and only if the norm satisfies for the condition . This result is extended to bivariate EVDs with arbitrary margins as well as to extreme value copulas. By identifying an EVD , , with the unit ball corresponding to the generating norm , we obtain a characterization of the class of EVDs in terms of compact and convex subsets of .     

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