Configurations in abelian categories. II. Ringel–Hall algebras

This is the second in a series on configurations in an abelian category . Given a finite poset (I,), an (I,)-configuration (σ,ι,π) is a finite collection of objects σ(J) and morphisms ι(J,K) or in satisfying some axioms, where J,KI. Configurations describe how an object X in decomposes into subobjects.The first paper defined configurations and studied moduli spaces of (I,)-configurations in , using the theory of Artin stacks. It showed well-behaved moduli stacks of objects and configurations in exist when is the abelian category coh(P) of coherent sheaves on a projective scheme P, or mod- of representations of a quiver Q.Write for the vector space of -valued constructible functions on the stack . Motivated by the idea of Ringel–Hall algebras, we define an associative multiplication * on using pushforwards and pullbacks along 1-morphisms between configuration moduli stacks, so that is a -algebra. We also study representations of , the Lie subalgebra of functions supported on indecomposables, and other algebraic structures on .Then we generalize all these ideas to stack functions , a universal generalization of constructible functions, containing more information. When Extⁱ(X,Y)=0 for all and i>1, or when for P a Calabi–Yau 3-fold, we construct (Lie) algebra morphisms from stack algebras to explicit algebras, which will be important in the sequels on invariants counting τ-semistable objects in .     

On complexity of Ehrenfeucht–Fraïssé games

In this paper, we initiate the study of Ehrenfeucht–Fraïssé games for some standard finite structures. Examples of such standard structures are equivalence relations, trees, unary relation structures, Boolean algebras, and some of their natural expansions. The paper concerns the following question that we call the Ehrenfeucht–Fraïssé problem. Given nω as a parameter, and two relational structures and from one of the classes of structures mentioned above, how efficient is it to decide if Duplicator wins the n-round EF game ? We provide algorithms for solving the Ehrenfeucht–Fraïssé problem for the mentioned classes of structures. The running times of all the algorithms are bounded by constants. We obtain the values of these constants as functions of n.     

The Fréchet and limiting subdifferentials of integral functionals on the spaces

A new approach to computing the Fréchet subdifferential and the limiting subdifferential of integral functionals is proposed. Thanks to this way, we obtain formulae for computing the Fréchet and limiting subdifferentials of the integral functional , uL₁(Ω,E). Here is a measured space with an atomless σ-finite complete positive measure, E is a separable Banach space, and . Under some assumptions, it turns out that these subdifferentials coincide with the Fenchel subdifferential of F.     

A characterization of the natural embedding of the split Cayley hexagon in by intersection numbers

In this paper, we prove that a set of q⁵+q⁴+q³+q²+q+1 lines of with the properties that (1) every point of is incident with either 0 or q+1 elements of , (2) every plane of is incident with either 0, 1 or q+1 elements of , (3) every solid of is incident with either 0, 1, q+1 or 2q+1 elements of , and (4) every hyperplane of is incident with at most q³+3q²+3q members of , is necessarily the set of lines of a regularly embedded split Cayley generalized hexagon in .     

Spaces of holomorphic functions in regular domains

Let Ω be a regular domain in the complex plane , . Let be the linear space over of the holomorphic functions f in Ω such that f⁽ⁿ⁾ is bounded in Ω and is continuously extendible to the closure of Ω, n=0,1,2,… . We endow , in a natural manner, with a structure of Fréchet space and we obtain dense subspaces F of , with good topological linear properties, also satisfying that each function f of F, distinct from zero, does not extend holomorphically outside Ω.     

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.     

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.     

Semifields of order with left nucleus and center

In [G. Marino, O. Polverino, R. Trombetti, On -linear sets of PG(3,q³) and semifields, J. Combin. Theory Ser. A 114 (5) (2007) 769–788] it has been proven that there exist six non-isotopic families (i=0,…,5) of semifields of order q⁶ with left nucleus and center , according to the different geometric configurations of the associated -linear sets. In this paper we first prove that any semifield of order q⁶ with left nucleus , right and middle nuclei and center is isotopic to a cyclic semifield. Then, we focus on the family by proving that it can be partitioned into three further non-isotopic families: , , and we show that any semifield of order q⁶ with left nucleus , right and middle nuclei and center belongs to the family .     

The maximal range problem for a bounded domain

Let be a bounded domain such that 0Ω. Denote by , the set of all complex polynomials of degree at most n. Let

where . We relate the maximal polynomial range

to the geometry of Ω.     

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.     

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 .     

Sur le groupe d'automorphismes des géométries paraboliques de rang 1

The aim of this article is to prove the following result, which generalizes the Ferrand–Obata theorem, concerning the conformal group of a Riemannian manifold, and the Schoen–Webster theorem about the automorphism group of a strictly pseudo-convex CR structure: let M be a connected manifold endowed with a regular Cartan geometry, modelled on the boundary of the hyperbolic space of dimension d2 over , being , , or the octonions . If the automorphism group of M does not act properly on M, then M is isomorphic, as a Cartan geometry, to X, or X minus a point.     

Über ein Turánsches problem für radiale, positiv definite Funktionen, II

Turán's problem is to determine the greatest possible value of the integral for positive definite functions f(x), , supported in a given convex centrally symmetric body , . We consider the problem for positive definite functions of the form f(x)=(x₁), , with supported in [0,π], extending results of our first paper from two to arbitrary dimensions.Our two papers were motivated by investigations of Professor Y. Xu and the 2nd named author on, what they called, ℓ-1 summability of the inverse Fourier integral on . Their investigations gave rise to a pair of transformations (h_d,m_d) on which they studied using special functions, in particular spherical Bessel functions.To study the d-dimensional Turán problem, we had to extend relevant results of B. & X., and we did so using again Bessel functions. These extentions seem to us to be equally interesting as the application to Turán's problem.     

On ternary Kloosterman sums modulo 12

Let K(a) denote the Kloosterman sum on . It is easy to see that for all . We completely characterize those for which , and . The simplicity of the characterization allows us to count the number of the belonging to each of these three classes. As a byproduct we offer an alternative proof for a new class of quasi-perfect ternary linear codes recently presented by Danev and Dodunekov.     

Properties of multilevel block -circulants

In a previous paper we characterized unilevel block α-circulants , , 0mn-1, in terms of the discrete Fourier transform of , defined by . We showed that most theoretical and computational problems concerning A can be conveniently studied in terms of corresponding problems concerning the Fourier coefficients F₀,F₁,…,F_n-1 individually. In this paper we show that analogous results hold for (k+1)-level matrices, where the first k levels have block circulant structure and the entries at the (k+1)-st level are unstructured rectangular matrices.     

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 uniform continuity

Let be an ideal of subsets of a metric space X,d. This paper considers a strengthening of the notion of uniform continuity of a function restricted to members of which reduces to ordinary continuity when consists of the finite subsets of X and agrees with uniform continuity on members of when is either the power set of X or the family of compact subsets of X. The paper also presents new function space topologies that are well suited to this strengthening. As a consequence of the general theory, we display necessary and sufficient conditions for continuity of the pointwise limit of a net of continuous functions.     

Region of variability for close-to-convex functions-II

For a complex number α with let be the class of analytic functions f in the unit disk with f(0)=0 satisfying in , for some convex univalent function in . For any fixed , and we shall determine the region of variability V(z₀,α,λ) for f(z₀) when f ranges over the class

In the final section we graphically illustrate the region of variability for several sets of parameters z₀ and α.     

Complete solutions to the Oberwolfach problem for an infinite set of orders

Let n3 and let F be a 2-regular graph of order n. The Oberwolfach problem OP(F) asks for a 2-factorisation of K_n if n is odd, or of K_n−I if n is even, in which each 2-factor is isomorphic to F. We show that there is an infinite set of primes congruent to such that OP(F) has a solution for any 2-regular graph F of order . We also show that for each of the infinitely many with prime, OP(F) has a solution for any 2-regular graph F of order n.     

On the pullback equation

We discuss the existence of a diffeomorphism such that

φ^*(g)=f