On the normalizing groupoids and the commensurability groupoids for inclusions of factors associated to ergodic equivalence relations–subrelations

It is shown that for the inclusion of factors corresponding to an inclusion of ergodic discrete measured equivalence relations , is normal in in the sense of Feldman–Sutherland–Zimmer [J. Feldman, C.E. Sutherland, R.J. Zimmer, Subrelations of ergodic equivalence relations, Ergodic Theory Dynam. Systems 9 (1989) 239–269] if and only if A is generated by the normalizing groupoid of B. Moreover, we show that there exists the largest intermediate equivalence subrelation which contains as a normal subrelation. We further give a definition of “commensurability groupoid” as a generalization of normality. We show that the commensurability groupoid of B in A generates A if and only if the inclusion BA is discrete in the sense of Izumi–Longo–Popa [M. Izumi, R. Longo, S. Popa, A Galois correspondence for compact groups of automorphisms of von Neumann algebras with a generalization to Kac algebras, J. Funct. Anal. 155 (1998) 25–63]. We also show that there exists the largest equivalence subrelation such that the inclusion is discrete. It turns out that the intermediate equivalence subrelations and thus defined can be viewed as groupoid-theoretic counterparts of a normalizer subgroup and a commensurability subgroup in group theory.     

Stationary twists and energy minimizers on a space of measure preserving maps

Let be a bounded Lipschitz domain, a suitably quasiconvex integrand and consider the energy functional

over the space of measure preserving maps

In this paper we discuss the question of existence of multiple strong local minimizers for over . Moreover, motivated by their significance in topology and the study of mapping class groups, we consider a class of maps, referred to as twists, and examine them in connection with the corresponding Euler–Lagrange equations and investigate various qualitative properties of the resulting solutions, the stationary twists. Particular attention is paid to the special case of the so-called p-Dirichlet energy, i.e., when .     

Theorems about the attractor for incompressible non-Newtonian flow driven by external forces that are rapidly oscillating in time but have a smooth average

This paper discusses the incompressible non-Newtonian fluid with rapidly oscillating external forces g(x,t)=g(x,t,t/) possessing the average g⁰(x,t) as →0⁺, where 0<₀<1. Firstly, with assumptions (A₁)–(A₅) on the functions g(x,t,ξ) and g⁰(x,t), we prove that the Hausdorff distance between the uniform attractors and in space H, corresponding to the oscillating equations and the averaged equation, respectively, is less than O() as →0⁺. Then we establish that the Hausdorff distance between the uniform attractors and in space V is also less than O() as →0⁺. Finally, we show for each [0,₀].     

Turán type reverse Markov inequalities for compact convex sets

For a compact convex set the well-known general Markov inequality holds asserting that a polynomial p of degree n must have p^′c(K)n²p. On the other hand for polynomials in general, p^′ can be arbitrarily small as compared to p.The situation changes when we assume that the polynomials in question have all their zeroes in the convex set K. This was first investigated by Turán, who showed the lower bounds p^′(n/2)p for the unit disk D and for the unit interval I[-1,1]. Although partial results provided general lower estimates of order , as well as certain classes of domains with lower bounds of order n, it was not clear what order of magnitude the general convex domains may admit here.Here we show that for all bounded and convex domains K with nonempty interior and polynomials p with all their zeroes lying in K p^′c(K)np holds true, while p^′C(K)np occurs for any K. Actually, we determine c(K) and C(K) within a factor of absolute numerical constant.     

Sharp tridiagonal pairs

Let denote a field and let V denote a vector space over with finite positive dimension. We consider a pair of -linear transformations A:V→V and A^*:V→V that satisfies the following conditions: (i) each of A,A^* is diagonalizable; (ii) there exists an ordering of the eigenspaces of A such that A^*V_iV_i-1+V_i+V_i+1 for 0id, where V_-1=0 and V_d+1=0; (iii) there exists an ordering of the eigenspaces of A^* such that for 0iδ, where and ; (iv) there is no subspace W of V such that AWW, A^*WW, W≠0, W≠V. We call such a pair a tridiagonal pair on V. It is known that d=δ and for 0id the dimensions of coincide. We say the pair A,A^* is sharp whenever dimV₀=1. A conjecture of Tatsuro Ito and the second author states that if is algebraically closed then A,A^* is sharp. In order to better understand and eventually prove the conjecture, in this paper we begin a systematic study of the sharp tridiagonal pairs. Our results are summarized as follows. Assuming A,A^* is sharp and using the data we define a finite sequence of scalars called the parameter array. We display some equations that show the geometric significance of the parameter array. We show how the parameter array is affected if Φ is replaced by or or . We prove that if the isomorphism class of Φ is determined by the parameter array then there exists a nondegenerate symmetric bilinear form , on V such that Au,v=u,Av and A^*u,v=u,A^*v for all u,vV.     

Lattices generated by subspaces in d-bounded distance-regular graphs

Let Γ denote a d-bounded distance-regular graph with diameter d2. A regular strongly closed subgraph of Γ is said to be a subspace of Γ. Define the empty set to be the subspace with diameter -1 in Γ. For 0ii+sd-1, let denote the set of all subspaces in Γ with diameters i,i+1,…,i+s including Γ and . If we define the partial order on by ordinary inclusion (resp. reverse inclusion), then is a poset, denoted by (resp. ). In the present paper we show that both and are atomic lattices, and classify their geometricity.     

Widths and shape-preserving widths of Sobolev-type classes of s-monotone functions

Let I be a finite interval, , and 1p∞. Given a set M, of functions defined on I, denote by the subset of all functions yM such that the s-difference is nonnegative on I, τ>0. Further, denote by the Sobolev class of functions x on I with the seminorm x^(r)_Lp1. We obtain the exact orders of the Kolmogorov and the linear widths, and of the shape-preserving widths of the classes in L_q for s>r+1 and (r,p,q)≠(1,1,∞). We show that while the widths of the classes depend in an essential way on the parameter s, which characterizes the shape of functions, the shape-preserving widths of these classes remain asymptotically ≈n^-2.     

Error bounds for the perturbation of the Drazin inverse under some geometrical conditions

This paper studies the Drazin inverse for perturbed matrices. For that, given a square matrix A, we consider and characterize the class of matrices B with index s such that , and , where and denote the null space and the range space of a matrix A, respectively, and A^D denote the Drazin inverse of A. Then, we provide explicit representations for B^D and BB^D, and upper bounds for the relative error B^D-A^D/A^D and the error BB^D-AA^D. A numerical example illustrates that the obtained bounds are better than others given in the literature.     

Uniform Kazhdan constant for some families of linear groups

Let R be a ring generated by l elements with stable range r. Assume that the group EL_d(R) has Kazhdan constant ₀>0 for some dr+1. We prove that there exist (₀,l)>0 and , s.t. for every nd, EL_n(R) has a generating set of order k and a Kazhdan constant larger than . As a consequence, we obtain for where n3, a Kazhdan constant which is independent of n w.r.t. generating set of a fixed size.     

Approximate range searching using binary space partitions

We show how any BSP tree for the endpoints of a set of n disjoint segments in the plane can be used to obtain a BSP tree of size for the segments themselves, such that the range-searching efficiency remains almost the same. We apply this technique to obtain a BSP tree of size O(nlogn) such that -approximate range searching queries with any constant-complexity convex query range can be answered in O(min_>0{(1/)+k}logn) time, where k is the number of segments intersecting the -extended range. The same result can be obtained for disjoint constant-complexity curves, if we allow the BSP to use splitting curves along the given curves.We also describe how to construct a linear-size BSP tree for low-density scenes consisting of n objects in such that -approximate range searching with any constant-complexity convex query range can be done in O(logn+min_>0{(1/^d−1)+k}) time.     

Strong and uniform mean stability of cosine and sine operator functions

It is first observed that a uniformly bounded cosine operator function C() and the associated sine function S() are totally non-stable. Then, using a zero-one law for the Abel limit of a closed linear operator, we prove some results concerning strong mean stability and uniform mean stability of C(). Among them are: (1) C() is strongly (C,1)-mean stable (or (C,2)-mean stable, or Abel-mean stable) if and only if 0ρ(A)σ_c(A); (2) C() is uniformly (C,2)-mean stable if and only if S() is uniformly (C,1)-mean stable, if and only if , if and only if , if and only if C() is uniformly Abel-mean stable, if and only if S() is uniformly Abel-mean stable, if and only if 0ρ(A).     

Equivalence relation groupoids associated with certain linearly ordered dimension groups

We consider linearly ordered, Archimedean dimension groups (G,G⁺,u) for which the group G/u is torsion-free. It will be shown that if, in addition, G/u is generated by a single element (i.e., ), then (G,G⁺,u) is isomorphic to for some irrational number τ(0,1). This amounts to an extension of related results where dimension groups for which G/u is torsion were considered. We will prove, in the case of the Fibonacci dimension group, that these results can be used to directly construct an equivalence relation groupoid whose C^*-algebra is the Fibonacci C^*-algebra.     

Two canonical passive state/signal shift realizations of passive discrete time behaviors

A discrete time invariant linear state/signal system Σ with a Hilbert state space and a Kren signal space has trajectories (x(),w()) that are solutions of the equation , where F is a bounded linear operator from into with a closed domain whose projection onto is all of . This system is passive if the graph of F is a maximal nonnegative subspace of the Kren space . The future behavior of a passive system Σ is the set of all signal components w() of trajectories (x(),w()) of Σ on with x(0)=0 and . This is always a maximal nonnegative shift-invariant subspace of the Kren space , i.e., the space endowed with the indefinite inner product inherited from . Subspaces of with this property are called passive future behaviors. In this work we study passive state/signal systems and passive behaviors (future, full, and past). In particular, we define and study the input and output maps of a passive state/signal system, and the past/future map of a passive behavior. We then turn to the inverse problem, and construct two passive state/signal realizations of a given passive future behavior , one of which is observable and backward conservative, and the other controllable and forward conservative. Both of these are canonical in the sense that they are uniquely determined by the given data , in contrast earlier realizations that depend not only on , but also on some arbitrarily chosen fundamental decomposition of the signal space . From our canonical realizations we are able to recover the two standard de Branges–Rovnyak input/state/output shift realizations of a given operator-valued Schur function in the unit disk.     

A characterization and equations for minimal shape-preserving projections

Let X denote a (real) Banach space and V an n-dimensional subspace. We denote by the space of all bounded linear operators from X into V; let be the set of all projections in . For a given , we denote by the set of operators such that PSS. When , we characterize those for which P is minimal. This characterization is then utilized in several applications and examples.     

On fully operator Lipschitz functions

Let be the disc algebra of all continuous complex-valued functions on the unit disc holomorphic in its interior. Functions from act on the set of all contraction operators (A1) on Hilbert spaces. It is proved that the following classes of functions from coincide: (1) the class of operator Lipschitz functions on the unit circle ; (2) the class of operator Lipschitz functions on ; and (3) the class of operator Lipschitz functions on all contraction operators. A similar result is obtained for the class of operator C₂-Lipschitz functions from .     

Asymptotic expression of the linear discrete best -approximation

Let h_p, 1<p<∞, be the best ℓ_p-approximation of the element from a proper affine subspace K of , hK, and let denote the strict uniform approximation of h from K. We prove that there are a vector and a real number a, 0a1, such that

for all p>1, where with γ_p=o(a^p/p).     

Eigenvalue estimates for non-normal matrices and the zeros of random orthogonal polynomials on the unit circle

We prove that for any n×n matrix, A, and z with |z|A, we have that . We apply this result to the study of random orthogonal polynomials on the unit circle.     

A characterization of Q-polynomial distance-regular graphs

Let Γ denote a distance-regular graph with diameter D3. Let θ denote a nontrivial eigenvalue of Γ and let denote the corresponding dual eigenvalue sequence. In this paper we prove that Γ is Q-polynomial with respect to θ if and only if the following (i)–(iii) hold:

(i) There exist such that

(1)

(ii) There exist such that the intersection numbers a_i satisfy

for 0iD, where and are the scalars which satisfy Eq. (1) for i=0, i=D, respectively.

(iii) for 1iD.

More on the revised GCH and the black box

We strengthen the revised GCH theorem by showing, e.g., that for , for all but finitely many regular κ<_ω, it holds that “λ is accessible on cofinality κ” in some weak sense (see below).As a corollary, λ=2^μ=μ⁺>_ω implies that the diamond holds on λ when restricted to cofinality κ for all but finitely many .We strengthen previous results on the black box and the middle diamond: previously it was established that these principles hold on for sufficiently large n; here we succeed in replacing a sufficiently large _n with a sufficiently large _n.The main theorem, concerning the accessibility of λ on cofinality κ, Theorem 3.1, implies as a special case that for every regular λ>_ω, for some κ<_ω, we can find a sequence such that , , and we can fix a finite set of “exceptional” regular cardinals θ<_ω so that if Aλ satisfies |A|<_ω, there is a pair-coloring so that for every -monochromatic BA with no last element, letting δ:=supB it holds that —provided that is not one of the finitely many “exceptional” members of .