Limits of small functors

For a small category enriched over a suitable monoidal category , the free completion of under colimits is the presheaf category . If is large, its free completion under colimits is the -category of small presheaves on , where a presheaf is small if it is a left Kan extension of some presheaf with small domain. We study the existence of limits and of monoidal closed structures on .     

Approximation of Sobolev classes by polynomials and ridge functions

Let be the usual Sobolev class of functions on the unit ball in , and be the subclass of all radial functions in . We show that for the classes and , the orders of best approximation by polynomials in coincide. We also obtain exact orders of best approximation in of the classes by ridge functions and, as an immediate consequence, we obtain the same orders in for the usual Sobolev classes .     

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 .     

Hypercyclic operators failing the Hypercyclicity Criterion on classical Banach spaces

By a recent result of M. De La Rosa and C. Read, there exist hypercyclic Banach space operators which do not satisfy the Hypercyclicity Criterion. In the present paper, we prove that such operators can be constructed on a large class of Banach spaces, including or .     

Polynomial-time approximation schemes for piercing and covering with applications in wireless networks

Let be a set of disks of arbitrary radii in the plane, and let be a set of points. We study the following three problems: (i) Assuming contains the set of center points of disks in , find a minimum-cardinality subset of (if exists), such that each disk in is pierced by at least h points of , where h is a given constant. We call this problem minimum h-piercing. (ii) Assuming is such that for each there exists a point in whose distance from D's center is at most αr(D), where r(D) is D's radius and 0α<1 is a given constant, find a minimum-cardinality subset of , such that each disk in is pierced by at least one point of . We call this problem minimum discrete piercing with cores. (iii) Assuming is the set of center points of disks in , and that each covers at most l points of , where l is a constant, find a minimum-cardinality subset of , such that each point of is covered by at least one disk of . We call this problem minimum center covering. For each of these problems we present a constant-factor approximation algorithm (trivial for problem (iii)), followed by a polynomial-time approximation scheme. The polynomial-time approximation schemes are based on an adapted and extended version of Chan's [T.M. Chan, Polynomial-time approximation schemes for packing and piercing fat objects, J. Algorithms 46 (2003) 178–189] separator theorem. Our PTAS for problem (ii) enables one, in practical cases, to obtain a (1+ε)-approximation for minimum discrete piercing (i.e., for arbitrary ).     

Lattices generated by orbits of subspaces under finite singular pseudo-symplectic groups I

Let be the (2ν+1+l)-dimensional vector space over the finite field . In the paper we assume that is a finite field of characteristic 2, and the singular pseudo-symplectic groups of degree 2ν+1+l over . Let be any orbit of subspaces under . Denote by the set of subspaces which are intersections of subspaces in and the intersection of the empty set of subspaces of is assumed to be . By ordering by ordinary or reverse inclusion, two lattices are obtained. This paper studies the inclusion relations between different lattices, a characterization of subspaces contained in a given lattice , and the characteristic polynomial of .     

Inheritance of hyper-duality in imprimitive Bose–Mesner algebras

We prove the following result concerning the inheritance of hyper-duality by block and quotient Bose–Mesner algebras associated with a hyper-dual pair of imprimitive Bose–Mesner algebras. Let and denote Bose–Mesner algebras. Suppose there is a hyper-duality ψ from the subconstituent algebra of with respect to p to the subconstituent algebra of with respect to . Also suppose that is imprimitive with respect to a subset of Hadamard idempotents, so is dual imprimitive with respect to the subset of primitive idempotents, where is the formal duality associated with ψ. Let denote the block Bose–Mesner algebra of on the block containing p, and let denote the quotient Bose–Mesner algebra of with respect to . Then there is a hyper-duality from the subconstituent algebra of with respect to p to the subconstituent algebra of with respect to .     

On the intersection of Hermitian curves and of Hermitian surfaces

Kestenband [Unital intersections in finite projective planes, Geom. Dedicata 11(1) (1981) 107–117; Degenerate unital intersections in finite projective planes, Geom. Dedicata 13(1) (1982) 101–106] determines the structure of the intersection of two Hermitian curves of PG(2,q²), degenerate or not. In this paper we give a new proof of Kestenband's results. Giuzzi [Hermitian varieties over finite field, Ph.D. Thesis, University of Sussex, 2001] determines the structure of the intersection of two non-degenerate Hermitian surfaces and of PG(3,q²) when the Hermitian pencil defined by and contains at least one degenerate Hermitian surface. We give a new proof of Giuzzi's results and we obtain some new results in the open case when all the Hermitian surfaces of the Hermitian pencil are non-degenerate.     

Formal extension and quotients of the invariant holonomic system

Let be a semisimple Lie algebra and a Cartan subalgebra of . Fix . Let be the invariant holonomic system (see [R. Hotta, M. Kashiwara, The invariant holonomic system on a semisimple Lie algebra, Invent. Math. 75 (1984) 327–358]). First we investigate its formal extension . In the sequel we calculate the characteristic variety of some simple quotients of and its Fourier transform .     

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 .     

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.     

-structure on the deformation complex of a morphism

-structure is shown to exist on the deformation complex of a morphism of associative algebras. The main step of the construction is the extension of a -algebra by an associative algebra. Actions of -algebras on associative and -algebras are analyzed; extensions of -algebras by associative and -algebras that they act upon are constructed. The resulting -algebra on the deformation complex of a morphism is shown to be quasi-isomorphic to the -algebra on the deformation complex of the corresponding diagram algebra.     

Ü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.     

Decomposing complete edge-chromatic graphs and hypergraphs. Revisited

A d-graph is a complete graph whose edges are colored by d colors, that is, partitioned into d subsets some of which might be empty. We say that a d-graph is complementary connected (CC) if the complement to each chromatic component of is connected on V. We prove that every such d-graph contains a sub-d-graph Π or , where Π has four vertices and two non-empty chromatic components each of which is a P₄, while is a three-colored triangle. This statement implies that each Π- and -free d-graph is uniquely decomposable in accordance with a tree whose leaves are the vertices of V and the interior vertices of T are labeled by the colors 1,…d. Such a tree is naturally interpreted as a positional game form (with perfect information and without moves of chance) of d players I={1,…,d} and n outcomes V={v₁,…,v_n}. Thus, we get a one-to-one correspondence between these game forms and Π- and -free d-graphs. As a corollary, we obtain a characterization of the normal forms of positional games with perfect information and, in case d=2, several characterizations of the read-once Boolean functions. These results are not new; in fact, they are 30 and, in case d=2, even 40 years old. Yet, some important proofs did not appear in English.Gyárfás and Simonyi recently proved a similar decomposition theorem for the -free d-graphs. They showed that each -free d-graph can be obtained from the d-graphs with only two non-empty chromatic components by successive substitutions. This theorem is based on results by Gallai, Lovász, Cameron and Edmonds. We obtain some new applications of these results.     

On the sizes of Delaunay meshes

Let be a polyhedral domain occupying a convex volume. We prove that the size of a graded mesh of with bounded vertex degree is within a factor of the size of any Delaunay mesh of with bounded radius-edge ratio. The term depends on the geometry of and it is likely a small constant when the boundaries of are fine triangular meshes. There are several consequences. First, among all Delaunay meshes with bounded radius-edge ratio, those returned by Delaunay refinement algorithms have asymptotically optimal sizes. This is another advantage of meshing with Delaunay refinement algorithms. Second, if no input angle is acute, the minimum Delaunay mesh with bounded radius-edge ratio is not much smaller than any minimum mesh with aspect ratio bounded by a particular constant.     

Generalized rough approximations in

In this paper we will treat a generalization of inner and outer approximations of fuzzy sets, which we will call -inner and -outer approximations respectively ( being any finite set of rational numbers in [0,1]). In particular we will discuss the case of those fuzzy sets which are definable in the logic by means of step functions from the hypercube [0,1]^k and taking value in an arbitrary (finite) subset of . Then, we will show that if a fuzzy set is definable as truth table of a formula of , then both its -inner and -outer approximation are definable as truth table of formulas of . Finally, we will introduce a generalization of abstract approximation spaces and compare our approach with the notion of fuzzy rough set.     

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 .     

Inverse eigenproblem for -symmetric matrices and their approximation

Let be a nontrivial involution, i.e., R=R⁻¹≠±I_n. We say that is R-symmetric if RGR=G. The set of all -symmetric matrices is denoted by . In this paper, we first give the solvability condition for the following inverse eigenproblem (IEP): given a set of vectors in and a set of complex numbers , find a matrix such that and are, respectively, the eigenvalues and eigenvectors of A. We then consider the following approximation problem: Given an n×n matrix , find such that , where is the solution set of IEP and is the Frobenius norm. We provide an explicit formula for the best approximation solution by means of the canonical correlation decomposition.     

On fractional maximal function and fractional integral on the Laguerre hypergroup

Let be the Laguerre hypergroup which is the fundamental manifold of the radial function space for the Heisenberg group. In this paper we obtain necessary and sufficient conditions on the parameters for the boundedness of the fractional maximal operator and the fractional integral operator on the Laguerre hypergroup from the spaces to the spaces and from the spaces to the weak spaces .     

A proof of a conjecture on the Randić index of graphs with given girth

The Randić index R(G) of a graph G is defined by , where is the degree of a vertex u in G and the summation extends over all edges uv of G. Aouchiche, Hansen and Zheng proposed the following conjecture: For any connected graph on n≥3 vertices with Randić index R and girth g,

with equalities if and only if . This paper is devoted to giving a confirmative proof to this conjecture.