Pseudo unitary conformal groups and Clifford algebras for standard pseudo hermitian spaces

This paper, self-contained, deals with pseudo-unitary spin geometry. First, we present pseudo-unitary conformal structures over a 2n-dimensional complex manifold V and the corresponding projective quadrics for standard pseudo-hermitian spaces H_p,q. Then we develop a geometrical presentation of a compactification for pseudo-hermitian standard spaces in order to construct the pseudo-unitary conformal group of H_p,q. We study the topology of the projective quadrics and the “generators” of such projective quadrics. Then we define the space S of spinors canonically associated with the pseudo-hermitian scalar product of signature (2ⁿ⁻¹, 2ⁿ⁻¹). The spinorial group Spin U(p,q) is imbedded into SU(2ⁿ⁻¹, 2ⁿ⁻¹). At last, we study the natural imbeddings of the projective quadrics      

A new extension theorem for 3-weight modulo q linear codes over $${\mathbb{F}_ q}$$

We prove that every [n, k, d] _q code with q ≥ 4, k ≥ 3, whose weights are congruent to 0, −1 or −2 modulo q and is extendable unless its diversity is for odd q, where .      

Blocking sets in PG(2, q n ) from cones of PG(2n, q)

Let Ω and be a subset of Σ = PG(2n−1,q) and a subset of PG(2n,q) respectively, with Σ ⊂ PG(2n,q) and . Denote by K the cone of vertex Ω and base and consider the point set B defined by

Error Correcting Sequence and Projective De Bruijn Graph

Let X be a finite set of q elements, and n, K, d be integers. A subset C ⊂ X ⁿ is an (n, K, d) error-correcting code, if #(C) = K and its minimum distance is d. We define an (n, K, d) error-correcting sequence over X as a periodic sequence {a _i } _i=0,1,... (a _i ∈ X) with period K, such that the set of all consecutive n-tuples of this sequence form an (n, K, d) error-correcting code over X. Under a moderate conjecture on the existence of some type of primitive polynomials, we prove that there is a error correcting sequence, such that its code-set is the q-ary Hamming code with 0 removed, for q > 2 being a prime power. For the case q = 2, under a similar conjecture, we prove that there is a error-correcting sequence, such that its code-set supplemented with 0 is the subset of the binary Hamming code [2 ^m  − 1, 2 ^m  − 1 − m, 3] obtained by requiring one specified coordinate being 0. Received: October 27, 2005. Final Version received: December 31, 2007     

Convex Minimization over the Fixed Point Set of Demicontractive Mappings

This paper deals with a viscosity iteration method, in a real Hilbert space , for minimizing a convex function over the fixed point set of , a mapping in the class of demicontractive operators, including the classes of quasi-nonexpansive and strictly pseudocontractive operators. The considered algorithm is written as: x _n+1 := (1 − w) v _n + w T v _n , v _n := x _n − α _n Θ′(x _n ), where w ∈ (0,1) and , Θ′ is the Gateaux derivative of Θ. Under classical conditions on T, Θ, Θ′ and the parameters, we prove that the sequence (x _n ) generated, with an arbitrary , by this scheme converges strongly to some element in Argmin _Fix(T) Θ.      

Explicit constructions of separating hash families from algebraic curves over finite fields

Let X be a set of order n and Y be a set of order m. An (n,m,{w ₁, w ₂})-separating hash family is a set of N functions from X to Y such that for any with , |X ₁| = w ₁ and |X ₂| = w ₂, there exists an element such that . In this paper, we provide explicit constructions of separating hash families using algebraic curves over finite fields. In particular, applying the Garcia–Stichtenoth curves, we obtain an infinite class of explicitly constructed (n,m,{w ₁,w ₂})–separating hash families with for fixed m, w ₁, and w ₂. Similar results for strong separating hash families are also obtained. As consequences of our main results, we present explicit constructions of infinite classes of frameproof codes, secure frameproof codes and identifiable parent property codes with length where n is the size of the codes. In fact, all the above explicit constructions of hash families and codes provide the best asymptotic behavior achieving the bound , which substantially improve the results in [ 8, 15, 17] give an answer to the fifth open problem presented in [11].     

New negative Latin square type partial difference sets in nonelementary abelian 2-groups and 3-groups

A partial difference set having parameters (n ², r(n − 1), n + r ² − 3r, r ² − r) is called a Latin square type partial difference set, while a partial difference set having parameters (n ², r(n + 1), − n + r ² + 3r, r ² + r) is called a negative Latin square type partial difference set. Nearly all known constructions of negative Latin square partial difference sets are in elementary abelian groups. In this paper, we develop three product theorems that construct negative Latin square type partial difference sets and Latin square type partial difference sets in direct products of abelian groups G and G′ when these groups have certain Latin square or negative Latin square type partial difference sets. Using these product theorems, we can construct negative Latin square type partial difference sets in groups of the form where the s _i are nonnegative integers and s ₀ + s ₁ ≥ 1. Another significant corollary to these theorems are constructions of two infinite families of negative Latin square type partial difference sets in 3-groups of the form for nonnegative integers s _i . Several constructions of Latin square type PDSs are also given in p-groups for all primes p. We will then briefly indicate how some of these results relate to amorphic association schemes. In particular, we construct amorphic association schemes with 4 classes using negative Latin square type graphs in many nonelementary abelian 2-groups; we also use negative Latin square type graphs whose underlying sets can be elementary abelian 3-groups or nonelementary abelian 3-groups to form 3-class amorphic association schemes.      

The <Emphasis Type="Italic">ψ</Emphasis>-associate <Emphasis Type="Italic">X</Emphasis><Superscript>#</Superscript> of a flat <Emphasis Type="Italic">X</Emphasis> in PG(<Emphasis Type="Italic">n</Emphasis>, 2)

For a given hypersurface ψ in PG(n, 2), with equation Q(x) = 0, where Q is a polynomial of (reduced) degree d > 1, a definition is given of the ψ-associate X ^# of a flat X in PG(n, 2). The definition involves the fully polarized form of the polynomial Q; in the cubic case d = 3 it reads: X ^# = {z ∈ PG(n, 2) | T(x, y, z) = 0 for all x, y ∈ X}, where T(x, y, z) denotes the alternating trilinear form obtained by completely polarizing Q. Some general results, valid for any degree d and projective dimension n, are first expounded. Thereafter several choices of ψ are visited, but for each choice just a few aspects are highlighted. Despite the partial nature of the survey quite a variety of behaviours of the ψ-associate are uncovered. Many of the choices of ψ which are considered are of cubic hypersurfaces in PG(5, 2). If ψ is the Segre variety it is shown that the 48 planes external to fall into eight pairs of ordered triplets {(P ₁, R ₁, S ₁), (P ₂, R ₂, S ₂)} such that and . Further those lines L of PG(5, 2) which are singular, satisfying that is L ^# = PG(5.2), are in this case shown to form a complete spread of 21 lines. Another result of note arises in the case where ψ is the underlying 35-set of a non-maximal partial spread Σ₅ of five planes in PG(5, 2), where it is shown that one plane is singled out by the property that every line is singular.      

Some Characterizations of Finite Hermitian Veroneseans

We characterize the finite Veronesean of all Hermitian varieties of PG(n,q²) as the unique representation of PG(n,q²) in PG(d,q), d n(n+2), where points and lines of PG(n,q²) are represented by points and ovoids of solids, respectively, of PG(d,q), with the only condition that the point set of PG(d,q) corresponding to the point set of PG(n,q²) generates PG(d,q). Using this result for n=2, we show that is characterized by the following properties: (1) ; (2) each hyperplane of PG(8,q) meets in q²+1, q³+1 or q³+q²+1 points; (3) each solid of PG(8,q) having at least q+3 points in common with shares exactly q²+1 points with it.51E24     

On the number of pairwise non-isomorphic minimal blocking sets in PG(2, q)

In this paper we examine whether the number of pairwise non-isomorphic minimal blocking sets in PG(2, q) of a certain size is larger than polynomial. Our main result is that there are more than polynomial pairwise non-isomorphic minimal blocking sets for any size in the intervals [2q−1, 3q−4] for q odd and for q square. We can also prove a similar result for certain values of the intervals and .      

On the Minimum Length of some Linear Codes of Dimension 5

In this paper, we shall prove that the minimum length n_q(5,d) is equal to g_q(5,d) +1 for q⁴−2q²−2q+1≤ d≤ q⁴ − 2q² − q and 2q⁴ − 2q³ − q² − 2q+1 ≤ d ≤ 2q⁴−2q³−q²−q, where g_q(5,d) means the Griesmer bound . Communicated by: J.D. Key     

Association schemes from the action of PGL(2, q) fixing a nonsingular conic in PG(2, q)

The group PGL(2,q) has an embedding into PGL(3,q) such that it acts as the group fixing a nonsingular conic in PG(2,q). This action affords a coherent configuration (q) on the set (q) of non-tangent lines of the conic. We show that the relations can be described by using the cross-ratio. Our results imply that the restrictions ₊(q) and ₋(q) of (q) to the set ₊(q) of secant (hyperbolic) lines and to the set ₋(q) of exterior (elliptic) lines, respectively, are both association schemes; moreover, we show that the elliptic scheme ₋(q) is pseudocyclic.We further show that the coherent configurations (q ²) with q even allow certain fusions. These provide a 4-class fusion of the hyperbolic scheme ₊(q ²), and 3-class fusions and 2-class fusions (strongly regular graphs) of both schemes ₊(q ²) and ₋(q ²). The fusion results for the hyperbolic case are known, but our approach here as well as our results in the elliptic case are new.     

Life span of solutions of a weakly coupled parabolic system

We consider the Cauchy problem for the weakly coupled parabolic system ∂ _t w _λ−Δ w _λ = F(w _λ) in R ^N , where λ > 0, w _λ = (u _λ, v _λ), F(w _λ) = (v _λ ^p , u _λ ^q ) for some p, q ≥ 1, pq > 1, and , for some nonnegative functions φ₁, φ₂ C ₀(R ^N ). If (p, q) is sub-critical or either φ₁ or φ₂ has slow decay at ∞, w _λ blows up for all λ > 0. Under these conditions, we study the blowup of w _λ for λ small.      

Some constructions on the Hermitian surface

In the geometric setting of commuting orthogonal and unitary polarities we construct an infinite family of complete (q + 1)²–spans of the Hermitian surface , q odd. A construction of an infinite family of minimal blocking sets of , q odd, admitting PSL ₂(q), is also provided.      

A sufficient condition for a number to be the order of a nonsingular derivation of a Lie algebra

A study of the set of positive integers which occur as orders of nonsingular derivations of finite-dimensional non-nilpotent Lie algebras of characteristic p > 0 was initiated by Shalev and continued by the present author. The main goal of this paper is to produce more elements of . Our main result shows that any divisor n of q − 1, where q is a power of p, such that n ≥ (p − 1)^1/p (q − 1)^1−1/(2p), necessarily belongs to . This extends its special case for p = 2 which was proved in a previous paper by a different method.     

On the negative cyclic homology of <Emphasis Type="Italic">shc</Emphasis>-algebras

Let be a field of characteristic and S ¹ the unit circle. We prove that the shc-structure on a cochain algebra (A,d _A ) induces an associative product on the negative cyclic homology HC _*⁻ A. When the cochain algebra (A,d _A ) is the algebra of normalized cochains of the simply connected topological space X with coefficients in , then HC _*⁻ A is isomorphic as a graded algebra to the S ¹-equivariant cohomology algebra of LX, the free loop space of X. We use the notion of shc-formality introduced in Topology 41, 85–106 (2002) to compute the S ¹-equivariant cohomology algebras of the free loop space of the complex projective space when n + 1 = 0 [p] and of the even spheres S ²ⁿ when p = 2.      

Codes that attain minimum distance in every possible direction

The following problem motivated by investigation of databases is studied. Let be a q-ary code of length n with the properties that has minimum distance at least n − k + 1, and for any set of k − 1 coordinates there exist two codewords that agree exactly there. Let f(q, k)be the maximum n for which such a code exists. f(q, k)is bounded by linear functions of k and q, and the exact values for special k and qare determined.      

Nonuniqueness in the quenching problem

This paper deals with nonnegative solutions of for

Constructions and bounds on linear error-block codes

We obtain new bounds on the parameters and we give new constructions of linear error-block codes. We obtain a Gilbert–Varshamov type construction. Using our bounds and constructions we obtain some infinite families of optimal linear error-block codes over . We also study the asymptotic of linear error-block codes. We define the real valued function α _q,m,a (δ), which is an analog of the important real valued function α _q (δ) in the asymptotic theory of classical linear error-correcting codes. We obtain both Gilbert–Varshamov and algebraic geometry type lower bounds on α _q,m,a (δ). We compare these lower bounds in graphs.