Containment of c<Subscript>0</Subscript> and ℓ<Subscript>1</Subscript> in π<Subscript>1</Subscript>(<Emphasis Type="Italic">E,F</Emphasis>)

Suppose π₁(E, F) is the space of all absolutely 1-summing operators between two Banach spacesE andF. We show that ifF has a copy of c₀, then π₁ (E, F) will have a copy of c₀, and under some conditions ifE has a copy of ℓ₁ then π₁ (E, F) would have a complemented copy of ℓ₁.     

<Emphasis Type="Italic">q</Emphasis>-extensions of Dougall’s bilateral <Subscript>2</Subscript>H<Subscript>2</Subscript>-series

Transformations for a bilateral ₂ ψ ₂-series are investigated by means of Abel’s lemma on summation by parts. Two q-extensions of Dougall’s classical identity for bilateral ₂H₂-sum are established. As by-products, the Rogers–Fine identity is recovered and a new proof is presented for Bailey’s identity of bilateral well-poised ₆ ψ ₆-series.     

Stabilization of Linear Switched Delay Systems: ℋ<Subscript>2</Subscript> and ℋ<Subscript>∞</Subscript> Methods

This paper presents new results pertaining to the delay-dependent stability and control synthesis of a class of linear switched continuous-time systems with time-varying delays. A new state transformation is introduced to exhibit the delay-dependent dynamics in the slow-time scale. For stability, we construct an appropriate selective Lyapunov functional to derive delay-dependent LMI-based sufficient conditions under arbitrary switching and without relying to overbounding. For the control synthesis, we design switched feedback schemes based on quadratic ℋ₂, ℋ_∞ and simultaneous ℋ₂/ℋ_∞ performance criteria. Under the developed transformation, it is established that both the instantaneous and delayed feedback control yield identical results. Numerical examples are presented to illustrate the analytical development.     

Dyadic Diaphony of Digital Nets Over ℤ<Subscript>2</Subscript>

The dyadic diaphony, introduced by Hellekalek and Leeb, is a quantitative measure for the irregularity of distribution of point sets in the unit-cube. In this paper we study the dyadic diaphony of digital nets over ℤ₂. We prove an upper bound for the dyadic diaphony of nets and show that the convergence order is best possible. This follows from a relation between the dyadic diaphony and the discrepancy. In order to investigate the case where the number of points is small compared to the dimension we introduce the limiting dyadic diaphony, which is defined as the limiting case where the dimension tends to infinity. We obtain a tight upper and lower bound and we compare this result with the limiting dyadic diaphony of a random sample.The first author is supported by the Australian Research Council under its Center of Excellence Program.The second author is supported by the Austrian Research Foundation (FWF), Project S 8305 and Project P17022-N12.     

Moduli spaces ℳ<Subscript>2,1</Subscript> and ℳ<Subscript>3,1</Subscript>

The cell structure of the spaces ℳ_2,1 and ℳ_3,1 is considered. These are the spaces of complex curves of genus 2 and 3 with one marked point. For the space ℳ_2,1, nine cells of the highest dimension 8 are described and their adjacency is studied. For the space ℳ_3,1, a list of all 1726 cells of the highest dimension 14 (with orientation) is obtained. The list of adjacent couples of cells is also obtained. These lists can be found on the web.     

Seas of squares with sizes from a Π<Stack><Subscript>1</Subscript><Superscript>0</Superscript></Stack> set

A family of sets is union-free if there are no three distinct sets in the family such that the union of two of the sets is equal to the third set. Kleitman proved that every union-free family has size at most (1+o(1))( _n/2 ⁿ ). Later, Burosch–Demetrovics–Katona–Kleitman–Sapozhenko asked for the number α(n) of such families, and they proved that \({2^{\left( {\begin{array}{*{20}{c}} n \\ {n/2} \end{array}} \right)}} \leqslant \alpha \left( n \right) \leqslant {2^{2\sqrt 2 \left( {\begin{array}{*{20}{c}} n \\ {n/2} \end{array}} \right)\left( {1 + o\left( 1 \right)} \right)}}\) They conjectured that the constant \(2\sqrt 2 \) can be removed in the exponent of the right-hand side. We prove their conjecture by formulating a new container-type theorem for rooted hypergraphs.     

GL<Subscript>2</Subscript>(ℂ)-orbits of binary forms

In the present paper we study the orbits of action of the group GL₂(ℂ) on the space of binary forms. The main result of the paper is the proof of the criterion which divides the GL₂(ℂ)-orbits of binary forms.     

Approximation Representations for Δ<Subscript>2</Subscript> Reals

We study ₂ reals x in terms of how they can be approximated symmetrically by a computable sequence of rationals. We deal with a natural notion of approximation representation and study how these are related computationally for a fixed x. This is a continuation of earlier work; it aims at a classification of ₂ reals based on approximation and it turns out to be quite different than the existing ones (based on information content etc.)Mathematics Subject Classification (2000): 03F60, 03D30     

Density of the Medvedev lattice of Π<Superscript>0</Superscript><Subscript>1</Subscript> classes

The partial ordering of Medvedev reducibility restricted to the family of ⁰₁ classes is shown to be dense. For two disjoint computably enumerable sets, the class of separating sets is an important example of a ⁰₁ class, which we call a ``c.e. separating class'. We show that there are no non-trivial meets for c.e. separating classes, but that the density theorem holds in the sublattice generated by the c.e. separating classes. Mathematics Subject Classification (2000): 03D30, 03D25     

Combined ℓ<Subscript>2</Subscript> data and gradient fitting in conjunction with ℓ<Subscript>1</Subscript> regularization

We are interested in minimizing functionals with ℓ₂ data and gradient fitting term and ℓ₁ regularization term with higher order derivatives in a discrete setting. We examine the structure of the solution in 1D by reformulating the original problem into a contact problem which can be solved by dual optimization techniques. The solution turns out to be a ’smooth’ discrete polynomial spline whose knots coincide with the contact points while its counterpart in the contact problem is a discrete version of a spline with higher defect and contact points as knots. In 2D we modify Chambolle’s algorithm to solve the minimization problem with the ℓ₁ norm of interacting second order partial derivatives as regularization term. We show that the algorithm can be implemented efficiently by applying the fast cosine transform. We demonstrate by numerical denoising examples that the ℓ₂ gradient fitting term can be used to avoid both edge blurring and staircasing effects.      

Irreducible ℤ<Subscript>+</Subscript>-modules of near-group fusion ring <Emphasis Type="Italic">K</Emphasis>(ℤ<Subscript>3</Subscript>, 3)

The near-group rings are an important class of fusion rings in the theory of tensor categories. In this paper, the irreducible ?₊-modules over the near-group fusion ring K(?₃, 3) are explicitly classified. It turns out that there are only four inequivalent irreducible ?₊-modules of rank 2 and two inequivalent irreducible ?₊-modules of rank 4 over K(?₃, 3).     

Cuts,Trees and ℓ<Subscript>1</Subscript>-Embeddings of Graphs*

Motivated by many recent algorithmic applications, this paper aims to promote a systematic study of the relationship between the topology of a graph and the metric distortion incurred when the graph is embedded into ₁ space. The main results are:1. Explicit constant-distortion embeddings of all series-parallel graphs, and all graphs with bounded Euler number. These are the first natural families known to have constant distortion (strictly greater than 1). Using the above embeddings, algorithms are obtained which approximate the sparsest cut in such graphs to within a constant factor.2. A constant-distortion embedding of outerplanar graphs into the restricted class of ₁-metrics known as dominating tree metrics. A lower bound of (log n) on the distortion for embeddings of series-parallel graphs into (distributions over) dominating tree metrics is also presented. This shows, surprisingly, that such metrics approximate distances very poorly even for families of graphs with low treewidth, and excludes the possibility of using them to explore the finer structure of ₁-embeddability.* A preliminary version of this work appeared in Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, 1999, pp. 399–408. This work was done while the author was at the University of California, Berkeley. Supported in part by NSF grants CCR-9505448 and CCR-9820951.     

On complexity reduction of Σ<Subscript>1</Subscript> formulas

 For a fixed q  ℕ and a given Σ₁ definition φ(d,x), where d is a parameter, we construct a model M of 1 Δ₀ + ? exp and a non standard d  M such that in M either φ has no witness smaller than d or phgr; is equivalent to a formula ϕ(d,x) having no more than q alternations of blocks of quantifiers. Received: 29 September 1998 / Revised version: 7 November 2001 Published online: 10 October 2002 RID="⋆" ID="⋆" Research supported in part by The State Committee for Scientific Research (Poland), KBN, grant number 2 PO3A 018 13. RID="⋆" ID="⋆" Research supported in part by The State Committee for Scientific Research (Poland), KBN, grant number 2 PO3A 018 13.     

On ℤ<Subscript>2</Subscript>-graded identities of the super tensor product of <Emphasis Type="Italic">UT</Emphasis><Subscript>2</Subscript>(<Emphasis Type="Italic">F</Emphasis>) by the Grassmann algebra

Let F be a field of characteristic zero and E be the unitary Grassmann algebra generated over an infinite-dimensional F-vector space L. Denote by \(\mathcal{E} = \mathcal{E}^{(0)} \oplus \mathcal{E}^{(1)}\) an arbitrary ?₂-grading of E such that the subspace L is homogeneous. Given a superalgebra A = A ⁽⁰⁾ ⊕ A ⁽¹⁾, define the superalgebra \(A\hat \otimes \mathcal{E}\) by \(A\hat \otimes \mathcal{E} = (A^{(0)} \otimes \mathcal{E}^{(0)} ) \oplus (A^{(1)} \otimes \mathcal{E}^{(1)} )\). Note that when E is the canonical grading of E then \(A\hat \otimes \mathcal{E}\) is the Grassmann envelope of A. In this work we find bases of ?₂-graded identities and we describe the ?₂-graded codimension and cocharacter sequences for the superalgebras \(UT_2 (F)\hat \otimes \mathcal{E}\), when the algebra UT ₂(F) of 2 ×2 upper triangular matrices over F is endowed with its canonical grading.     

Topological recursion relation for <Emphasis Type="Italic">ψ</Emphasis><Subscript>1</Subscript><Emphasis Type="Italic">ψ</Emphasis><Subscript>2</Subscript> in

We give the definition of the full potential with descendants, which is a genus expansion of the Barannikov-Kontsevich solution of the WDVV equation. This potential satisfies the Getzler relation, which comes from the geometry of the moduli space of curves Open image in new window .     

Quincunx multiresolution analysis for <Emphasis Type="Italic">L</Emphasis><Superscript>2</Superscript>(ℚ<Stack><Subscript>2</Subscript><Superscript>2</Superscript></Stack>)

With an eye on applications in quantum mechanics and other areas of science, much work has been done to generalize traditional analytic methods to p-adic systems. In 2002 the first paper on p-adic wavelets was published. Since then p-adic wavelet sets, multiresolution analyses, and wavelet frames have all been introduced. However, so far all constructions have involved dilations by p. This paper presents the first construction of a p-adic wavelet system with a more general matrix dilation, laying the foundation for further work in this direction.     

Local structure of Rogers semilattices of Σ<Subscript>n</Subscript><Superscript>0</Superscript>-computable numberings

We deal in specific features of the algebraic structure of Rogers semilattices of _n ⁰-computable numberings, for n 2. It is proved that any Lachlan semilattice is embeddable (as an ideal) in such every semilattice, and that over an arbitrary non 0-principal element of such a lattice, any Lachlan semilattice is embeddable (as an interval) in it.Supported by INTAS grant No. 00-499, by FP Universities of Russia grant UR.04.01.013, and by the Grant Center for Fundamental Research (GCFR), project PD02-1.1-475.__________Translated from Algebra i Logika, Vol. 44, No. 2, pp. 148–172, March–April, 2005.     

Distance-Regular Graph with <Emphasis Type="Italic">c</Emphasis><Subscript>2</Subscript> > 1 and <Emphasis Type="Italic">a</Emphasis><Subscript>1</Subscript> = 0 < <Emphasis Type="Italic">a</Emphasis><Subscript>2</Subscript>

Let Γ be a distance-regular graph of diameter d ≥ 3 with c ₂ > 1. Let m be an integer with 1 ≤ m ≤ d − 1. We consider the following conditions:

Spin structures and spectra of ℤ<Subscript>2</Subscript><Superscript><Emphasis Type="Italic">k</Emphasis></Superscript>-manifolds

We give necessary and sufficient conditions for the existence of pin^± and spin structures on Riemannian manifolds with holonomy group ₂^k. For any n4 (resp. n6) we give examples of pairs of compact manifolds (resp. compact orientable manifolds) M₁, M₂, non homeomorphic to each other, that are Laplace isospectral on functions and on p-forms for any p and such that M₁ admits a pin^± (resp. spin) structure whereas M₂ does not.Mathematics Subject Classification (2000):58J53, 57R15, 20H15Partially supported by Conicet and grants from SecytUNC, Foncyt and AgCba.