Plane polynomial automorphisms of fixed multidegree

Let be the group of polynomial automorphisms of the complex affine plane. On one hand, can be endowed with the structure of an infinite dimensional algebraic group (see Shafarevich in Math USSR Izv 18:214–226, 1982) and on the other hand there is a partition of according to the multidegree (see Friedland and Milnor in Ergod Th Dyn Syst 9:67–99, 1989). Let denote the set of automorphisms whose multidegree is equal to d. We prove that is a smooth, locally closed subset of and show some related results. We give some applications to the study of the varieties (resp. ) of automorphisms whose degree is equal to m (resp. is less than or equal to m).     

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.      

Analytic properties in the spectrum of certain Banach algebras

We show a sufficient condition for a domain in to be a H ^∞-domain of holomorphy. Furthermore if a domain has the Gleason property at a point and the projection of the n − 1th order generalized Shilov boundary does not coincide with Ω then is schlicht. We also give two examples of pseudoconvex domains in which the spectrum is non-schlicht and satisfy several other interesting properties.      

On the Multiplicity of Nodal Solutions to a Singularly Perturbed Neumann Problem

We consider the problem

Reduced Minimum Modulus Preserving in Banach Space

Let be the algebra of all bounded linear operators on a complex Banach space X and γ(T) be the reduced minimum modulus of operator . In this work, we prove that if , is a surjective linear map such that is an invertible operator, then , for every , if and only if, either there exist two bijective isometries and such that for every , or there exist two bijective isometries and such that for every . This generalizes for a Banach space the Mbekhta’s theorem [12].      

Surfaces with many solitary points

It is classically known that a real cubic surface in cannot have more than one solitary point (or -singularity, locally given by x ² + y ² + z ² = 0) whereas it can have up to four nodes (or -singularity, locally given by x ² + y ² − z ² = 0). We show that on any surface of degree d ≥ 3 in the maximum possible number of solitary points is strictly smaller than the maximum possible number of nodes. Conversely, we adapt a construction of Chmutov to obtain surfaces with many solitary points by using a refined version of Brusotti’s Theorem. Combining lower and upper bounds, we deduce: , where denotes the maximum possible number of solitary points on a real surface of degree d in . Finally, we adapt this construction to get real algebraic surfaces in with many singular points of type for all k ≥ 1.      

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      

A priori bounds and a Liouville theorem on a half-space for higher-order elliptic Dirichlet problems

We consider the 2m-th order elliptic boundary value problem Lu = f (x, u) on a bounded smooth domain with Dirichlet boundary conditions on ∂Ω. The operator L is a uniformly elliptic operator of order 2m given by . For the nonlinearity we assume that , where are positive functions and q > 1 if N ≤ 2m, if N > 2m. We prove a priori bounds, i.e, we show that for every solution u, where C > 0 is a constant. The solutions are allowed to be sign-changing. The proof is done by a blow-up argument which relies on the following new Liouville-type theorem on a half-space: if u is a classical, bounded, non-negative solution of ( − Δ) ^m u  =  u ^q in with Dirichlet boundary conditions on and q > 1 if N ≤ 2m, if N > 2m then .      

Intersection homology Künneth theorems

Cohen, Goresky, and Ji showed that there is a Künneth theorem relating the intersection homology groups to and , provided that the perversity satisfies rather strict conditions. We consider biperversities and prove that there is a Künneth theorem relating to and for all choices of and . Furthermore, we prove that the Künneth theorem still holds when the biperversity p, q is “loosened” a little, and using this we recover the Künneth theorem of Cohen–Goresky–Ji.     

Chains and antichains in partial orderings

We study the complexity of infinite chains and antichains in computable partial orderings. We show that there is a computable partial ordering which has an infinite chain but none that is or , and also obtain the analogous result for antichains. On the other hand, we show that every computable partial ordering which has an infinite chain must have an infinite chain that is the difference of two sets. Our main result is that there is a computably axiomatizable theory K of partial orderings such that K has a computable model with arbitrarily long finite chains but no computable model with an infinite chain. We also prove the corresponding result for antichains. Finally, we prove that if a computable partial ordering has the feature that for every , there is an infinite chain or antichain that is relative to , then we have uniform dichotomy: either for all copies of , there is an infinite chain that is relative to , or for all copies of , there is an infinite antichain that is relative to .