Commuting polarities and maximal partial ovoids of H(4,q2)

In PG(4,q²), q odd, let Q(4,q²) be a non‐singular quadric commuting with a non‐singular Hermitian variety H(4,q²). Then these varieties intersect in the set of points covered by the extended generators of a non‐singular quadric Q₀ in a Baer subgeometry Σ₀ of PG(4,q²). It is proved that any maximal partial ovoid of H(4,q²) intersecting Q₀ in an ovoid has size at least 2(q²+1). Further, given an ovoid O of Q₀, we construct maximal partial ovoids of H(4,q²) of size q³+1 whose set of points lies on the hyperbolic lines 〈P,X〉 where P is a fixed point of O and X varies in O\{P}. © 2009 Wiley Periodicals, Inc. J Combin Designs 17: 307–313, 2009     

Minimal extensions of Π01 classes

A minimal extension of a Π⁰₁ class P is a Π⁰₁ class Q such that P ? Q, Q – P is infinite, and for any Π⁰₁ class R, if P ? R ? Q, then either R – P is finite or Q – R is finite; Q is a nontrivial minimal extension of P if in addition P and Q′ have the same Cantor‐Bendixson derivative. We show that for any class P which has a single limit point A, and that point of degree ≤ 0 , P admits a nontrivial minimal extension. We also show that as long as P is infinite, then P does not admit any decidable nontrivial minimal extension Q. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Embeddings into the Medvedev and Muchnik lattices of Π<Superscript>0</Superscript><Subscript>1</Subscript> classes

Let _w and _M be the countable distributive lattices of Muchnik and Medvedev degrees of non-empty ₁⁰ subsets of 2, under Muchnik and Medvedev reducibility, respectively. We show that all countable distributive lattices are lattice-embeddable below any non-zero element of _w. We show that many countable distributive lattices are lattice-embeddable below any non-zero element of _M.Simpsons research was partially supported by NSF Grant DMS-0070718. We thank the anonymous referee for a careful reading of this paper and helpful comments.     

On Fractional GJMS Operators

We describe a new interpretation of the fractional GJMS operators as generalized Dirichlet‐to‐Neumann operators associated to weighted GJMS operators on naturally associated smooth metric measure spaces. This gives a geometric interpretation of the Caffarelli‐Silvestre extension for (?Δ)^γ when γ ? (0,1), and both a geometric interpretation and a curved analogue of the higher‐order extension found by R. Yang for (?Δ)^γ when γ > 1. We give three applications of this correspondence. First, we exhibit some energy identities for the fractional GJMS operators in terms of energies in the compactified Poincaré‐Einstein manifold, including an interpretation as a renormalized energy. Second, for γ ? (1,2), we show that if the scalar curvature and the fractional Q‐curvature Q_2γ of the boundary are nonnegative, then the fractional GJMS operator P_2γ is nonnegative. Third, by assuming additionally that Q_2γ is not identically zero, we show that P_2γ satisfies a strong maximum principle.© 2016 Wiley Periodicals, Inc.     

The k‐ary Montgomery modular inverse over nonbinary computers

This paper presents a k‐ary Montgomery modular inverse algorithm over nonbinary computers by using Sedjelmaci's right shift k‐ary greatest common divisor scheme. Over traditional binary computers, Kaliski's scheme can output Montgomery modular inverse Q ^{? 1}2ⁿ mod P, where P is coprime to Q and n is the bit length of P. Over k‐ary computers, our algorithm can discover the k‐ary Montgomery inverse Q ^{? 1}k^m mod P, where P, Q, and k are pairwise relatively prime positive integers and m = log _kP. In the worst case, the computational cost of our algorithm is O(m²)k‐ary digit operations. Copyright © 2013 John Wiley & Sons, Ltd.     

Locally compact (2, 2)‐transformation groups

We determine all locally compact imprimitive transformation groups acting sharply 2‐transitively on a non‐totally disconnected quotient space of blocks inducing on any block a sharply 2‐transitive group and satisfying the following condition: if Δ₁, Δ₂ are two distinct blocks and P_i, Q_i ∈ Δ_i (i = 1, 2), then there is just one element in the inertia subgroup which maps P_i onto Q_i. These groups are natural generalizations of the group of affine mappings of the line over the algebra of dual numbers over the field of real or complex numbers or over the skew‐field of quaternions. For imprimitive locally compact groups, our results correspond to the classical results of Kalscheuer for primitive locally compact groups (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Unconditional superconvergent analysis of a new mixed finite element method for Ginzburg–Landau equation

In this article, unconditional superconvergent analysis of a linearized fully discrete mixed finite element method is presented for a class of Ginzburg–Landau equation based on the bilinear element and zero‐order Nédélec's element pair (Q₁₁/Q₀₁ × Q₁₀). First, a time‐discrete system is introduced to split the error into temporal error and spatial error, and the corresponding error estimates are deduced rigorously. Second, the unconditional superclose and optimal estimate of order O(h² + τ) for u in H¹‐norm and p = ?u in L²‐norm are derived respectively without the restrictions on the ratio between h and τ, where h is the subdivision parameter and τ, the time step. Third, the global superconvergent results are obtained by interpolated postprocessing technique. Finally, some numerical results are carried out to confirm the theoretical analysis.     

Unitary similarity of algebras generated by pairs of orthoprojectors

It is shown that the unitary similarity of two matrix algebras generated by pairs of orthoprojectors { P₁, Q₁} and {P₂,Q₂} can be verified by comparing the traces of P₁, Q₁, and (P₁Q₁)ⁱ, i = 1, 2, …, n, with those of P₂, Q₂, and (P₂Q₂)ⁱ. The conditions of the unitary similarity of two matrices with quadratic minimal polynomials presented in [A. George and Kh. D. Ikramov, Unitary similarity of matrices with quadratic minimal polynomials, Linear Algebra Appl., 349, 11–16 (2002)] are refined. Bibliography: 10 titles. __________ Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 323, 2005, pp. 5–14.     

Sufficient conditions for the existence of a left quotient ring of a ring decomposed into a direct sum of left ideals

Let R=P₁⊕P₂⊕…⊕P_n be a decomposition of a ring into a direct sum of indecomposable left ideals. Assume that these ideals possess the following properties: (1) any nonzero homomorphisms ϕ: P_i→P_j is a monomorphism; (2) if subideals Q₁, Q₂ of the ideal P_j are isomorphic to the ideal P_i, then there exists a subideal Q₃⊆Q₁⊎Q₂, which is also isomorphic to P_i. It is proved that, under these asumptions, a left quotient ring of the ring R exists. This left quotient ring inherits properties(1), (2) and satisfies condition (3): any nonzero homomorphism ϕ: P_i→P_i is an automorphism of the ideal P_i. Bibliography: 2 titles. Translated fromZapiski Nauchnyk Seminarov POMI, Vol. 227, 1995, pp. 9–14.     

The automorphism group of a function lattice: A problem of Jónsson and McKenzie

It is shown that Aut(L ^Q ) is naturally isomorphic to Aut(L) × Aut(Q) whenL is a directly and exponentially indecomposable lattice,Q a non-empty connected poset, and one of the following holds:Q is arbitrary butL is ajm-lattice,Q is finitely factorable and L is complete with a join-dense subset of completely join-irreducible elements, orL is arbitrary butQ is finite. A problem of Jónsson and McKenzie is thereby solved. Sharp conditions are found guaranteeing the injectivity of the natural mapv _P,Q from Aut(P) × Aut(Q) to Aut(P ^Q )P andQ posets), correcting misstatements made by previous authors. It is proven that, for a bounded posetP and arbitraryQ, the Dedekind-MacNeille completion ofP ^Q ,DM(P ^Q ), is isomorphic toDM(P)^Q. This isomorphism is used to prove that the natural mapv _P,Q is an isomorphism ifv _DM(P),Q is, reducing a poset problem to a more tractable lattice problem.Presented by B. Jonsson.The author would like to thank his supervisor, Dr. H. A. Priestley, for her direction and advice as well as his undergraduate supervisor, Prof. Garrett Birkhoff, and Dr. P. M. Neumann for comments regarding the paper. This material is based upon work supported under a (U.S.) National Science Foundation Graduate Research Fellowship and a Marshall Aid Commemoration Commission Scholarship.     

Existence of T*(3, 4,v)‐codes

A word of length k over an alphabet Q of size v is a vector of length k with coordinates taken from Q. Let Q^*₄ be the set of all words of length 4 over Q. A T^*(3, 4, v)‐code over Q is a subset C^*? Q^*₄ such that every word of length 3 over Q occurs as a subword in exactly one word of C^*. Levenshtein has proved that a T^*(3, 4, vv)‐code exists for all even v. In this paper, the notion of a generalized candelabra t‐system is introduced and used to show that a T^*(3, 4, v)‐code exists for all odd v. Combining this with Levenshtein's result, the existence problem for a T^*(3,4, v)‐code is solved completely. © 2004 Wiley Periodicals, Inc. J Combin Designs 13: 42–53, 2005.     

Using a Mixed Integer Quadratic Programming Solver for the Unconstrained Quadratic 0-1 Problem

In this paper, we consider problem (P) of minimizing a quadratic function q(x)=x ^t Qx+c ^t x of binary variables. Our main idea is to use the recent Mixed Integer Quadratic Programming (MIQP) solvers. But, for this, we have to first convexify the objective function q(x). A classical trick is to raise up the diagonal entries of Q by a vector u until (Q+diag(u)) is positive semidefinite. Then, using the fact that x _i ²=x _i, we can obtain an equivalent convex objective function, which can then be handled by an MIQP solver. Hence, computing a suitable vector u constitutes a preprocessing phase in this exact solution method. We devise two different preprocessing methods. The first one is straightforward and consists in computing the smallest eigenvalue of Q. In the second method, vector u is obtained once a classical SDP relaxation of (P) is solved. We carry out computational tests using the generator of (Pardalos and Rodgers, 1990) and we compare our two solution methods to several other exact solution methods. Furthermore, we report computational results for the max-cut problem.     

Faisceaux sans torsion et faisceaux quasi localement libres sur les courbes multiples primitives

This paper is devoted to the study of some coherent sheaves on non reduced curves that can be locally embedded in smooth surfaces. If Y is such a curve and n is its multiplicity, then there is a filtration C₁ = C ? C₂ ? … ? C_n = Y such that C is the reduced curve associated to Y, and for every P ∈ C, if z ∈ O_Y,P is an equation of C then (zⁱ) is the ideal of C_i in O_Y,P. A coherent sheaf on Y is called torsion free if it does not have any non zero subsheaf with finite support. We prove that torsion free sheaves are reflexive. We study then the quasi locally free sheaves, i.e., sheaves which are locally isomorphic to direct sums of the O_Ci.We define an invariant for these sheaves, the complete type, and prove the irreducibility of the set of sheaves of given complete type. We study the generic quasi locally free sheaves, with applications to the moduli spaces of stable sheaves on Y (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Uniform vector bundles on quadrics

Summary In this paper we prove that a rankr uniform vector bundle on a nonsingular quadricQ with dimQ≥2r+2 is a direct sum of line bundles. We study also rank 2 uniform vector bundles onP ₁×P₁. We prove that they are not all homogeneous and that any rank 2 homogeneous vector bundles onP ₁×P₁ is decomposable.

---

Riassunto In questo lavoro si dimostra che un fibrato uniforme di rangor su una quadrica non singolareQ con dimQ≥2r+2 è somma diretta di fibrati in rette. Si studiano poi i fibrati uniformi di rango 2 suP ₁×P₁. Si dimostra che non sono tutti omogenei e che ogni fibrato omogeneo di rango 2 suP ₁×P₁ è decomponibile.

---

---

The author is member of G.N.S.A.G.A. of C.N.R.     

On Generalized Friedrichs and Krein‐von Neumann Extensions and Canonical Systems

Let S be a densely defined and closed symmetric relation in a Hilbert space ℋ︁ with defect numbers (1,1), and let A be some of its canonical selfadjoint extensions. According to Krein's formula, to S and A corresponds a so‐called Q‐function from the Nevanlinna class N . In this note we show to which subclasses N _γ of N the Q‐functions corresponding to S and its canonical selfadjoint extensions belong and specify the Q‐functions of the generalized Friedrichs and Krein‐von Neumann extensions. A result of L. de Branges implies that to each function Q ∈ N there corresponds a unique Hamiltonian H such that Q is the Titchmarsh‐Weyl coefficient of the two‐dimensional canonical system J_y′ = —zHy on [0, ∞) where Weyl's limit point case prevails at ∞. Then the boundary condition y(0) = 0 corresponds to a symmetric relation T_min with defect numbers (1,1) in the Hilbert space L²_H, and Q is equal to the Q‐function with respect to the extension corresponding to the boundary condition y₁(0) = 0. If H satisfies some growth conditions at 0 or ∞, wepresent results on the corresponding Q‐functions and show under which conditions the generalized Friedrichs or Krein‐von Neumann extension exists.     

Symmetric designs with bruck subdesigns

IfP is a finite projective plane of ordern with a proper subplaneQ of orderm which is not a Baer subplane, then a theorem of Bruck [Trans. AMS 78(1955), 464–481] asserts thatn≧m ²+m. If the equalityn=m ²+m were to occur thenP would be of composite order andQ should be called a Bruck subplane. It can be shown that if a projective planeP contains a Bruck subplaneQ, then in factP contains a designQ′ which has the parameters of the lines in a three dimensional projective geometry of orderm. A well known scheme of Bruck suggests using such aQ′ to constructP. Bruck’s theorem readily extends to symmetric designs [Kantor, Trans. AMS 146 (1969), 1–28], hence the concept of a Bruck subdesign. This paper develops the analoque ofQ′ and shows (by example) that the analogous construction scheme can be used to find symmetric designs.     

Order and chaos in Hofstadter's Q(n) sequence

A number of observations are made on Hofstadter's integer sequence defined by Q(n) = Q(n − Q(n − 1)) + Q(n − Q(n − 2)), for n > 2, and Q(1) = Q(2) = 1. On short scales, the sequence looks chaotic. It turns out, however, that the Q(n) can be grouped into a sequence of generations. The k‐th generation has 2^k members that have “parents” mostly in generation k − 1 and a few from generation k − 2. In this sense, the sequence becomes Fibonacci type on a logarithmic scale. The variance of S(n) = Q(n) − n/2, averaged over generations, is ≅2^αk, with exponent α = 0.88(1). The probability distribution p*(x) of x = R(n) = S(n)/n^α, n ≫ 1, is well defined and strongly non‐Gaussian, with tails well described by the error function erfc. The probability distribution of x_m = R(n) − R(n − m) is given by p_m(x_m) = λ_m p*(x_m/λ_m), with λ_m → √2 for large m. © 1999 John Wiley & Sons, Inc.     

Mixing properties of Markov operators and ergodic transformations,and ergodicity of cartesian products

LetT be a Markov operator onL ₁(X, Σ,m) withT*=P. We connect properties ofP with properties of all productsP ×Q, forQ in a certain class: (a) (Weak mixing theorem)P is ergodic and has no unimodular eigenvalues ≠ 1 ⇔ for everyQ ergodic with finite invariant measureP ×Q is ergodic ⇔ for everyu ∈L ₁ with∝ udm=0 and everyf ∈L _∞ we haveN ⁻¹Σ _n ^≠1/N |<u, P ⁿf>|→0. (b) For everyu ∈L ₁ with∝ udm=0 we have ‖T ⁿu‖₁ → 0 ⇔ for every ergodicQ, P ×Q is ergodic. (c)P has a finite invariant measure equivalent tom ⇔ for every conservativeQ, P ×Q is conservative. The recent notion of mild mixing is also treated. Dedicated to the memory of Shlomo Horowitz An erratum to this article is available at .