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 .     

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.     

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 .     

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 .     

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.     

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 .     

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

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 .     

The Burnside ring of fusion systems

Given a saturated fusion system on a finite p-group S we define a ring modeled on the Burnside ring of finite groups. We show that these rings have several properties in common. When is the fusion system of G we describe the relationship between these rings.     

Imprimitive symmetric graphs with cyclic blocks

Let Γ be a graph admitting an arc-transitive subgroup G of automorphisms that leaves invariant a vertex partition with parts of size v≥3. In this paper we study such graphs where: for connected by some edge of Γ, exactly two vertices of B lie on no edge with a vertex of C; and as C runs over all parts of connected to B these vertex pairs (ignoring multiplicities) form a cycle. We prove that this occurs if and only if v=3 or 4, and moreover we give three geometric or group theoretic constructions of infinite families of such graphs.     

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

Additive maps preserving the ascent and descent of operators

Let and be the algebras of all bounded linear operators on infinite dimensional complex Banach spaces X and Y, respectively. We characterize additive maps from onto preserving different quantities such as the nullity, the defect, the ascent, and the descent of operators.     

Common hermitian and positive solutions to the adjointable operator equations ,

Let be a C^*-algebra. For any Hilbert -modules H and K, let be the set of adjointable operators from H to K. Let H,K,L be Hilbert -modules, and . In this paper, we propose necessary and sufficient conditions for the existence of common hermitian and positive solutions to the equations , and obtain the formulae for the general forms of these solutions. Some results, known for finite matrices and Hilbert space operators, are extended to the adjointable operators acting on Hilbert C^*-modules.     

The maximum edit distance from hereditary graph properties

For a graph property , the edit distance of a graph G from , denoted , is the minimum number of edge modifications (additions or deletions) one needs to apply to G in order to turn it into a graph satisfying . What is the largest possible edit distance of a graph on n vertices from ? Denote this distance by .A graph property is hereditary if it is closed under removal of vertices. In a previous work, the authors show that for any hereditary property, a random graph essentially achieves the maximal distance from , proving: with high probability. The proof implicitly asserts the existence of such , but it does not supply a general tool for determining its value or the edit distance.In this paper, we determine the values of and for some subfamilies of hereditary properties including sparse hereditary properties, complement invariant properties, (r,s)-colorability and more. We provide methods for analyzing the maximum edit distance from the graph properties of being induced H-free for some graphs H, and use it to show that in some natural cases G(n,1/2) is not the furthest graph. Throughout the paper, the various tools let us deduce the asymptotic maximum edit distance from some well studied hereditary graph properties, such as being Perfect, Chordal, Interval, Permutation, Claw-Free, Cograph and more. We also determine the edit distance of G(n,1/2) from any hereditary property, and investigate the behavior of as a function of p.The proofs combine several tools in Extremal Graph Theory, including strengthened versions of the Szemerédi Regularity Lemma, Ramsey Theory and properties of random graphs.     

On Jordan ideals and matrix rings

For A, a commutative ring, and results by Costa and Keller characterize certain -normalized subgroups of the symplectic group, via structures utilizing Jordan ideals and the notion of radices. The following work creates a Jordan ideal structure theorem for -graded rings, A₀A₁, and a -graded matrix algebra. The major theorem is a generalization of Costa and Keller’s previous work on matrix algebras over commutative rings.     

On periodicity and low complexity of infinite permutations

We define an infinite permutation as a sequence of reals taken up to value, or, equivalently, as a linear ordering of or of . We introduce and characterize periodic permutations; surprisingly, for each period t there is an infinite number of distinct t-periodic permutations. At last, we study a complexity notion for permutations analogous to subword complexity for words, and consider the problem of minimal complexity of non-periodic permutations. Its answer is not analogous to that for words and is different for the right infinite and the bi-infinite case.     

n-Star modules over ring extensions

We give conditions under which an n-star module extends to an n-star module, or an n-tilting module, over a ring extension R of A. In case that R is a split extension of A by Q, we obtain that is a 1-tilting module (respectively, a 1-star module) if and only if is a 1-tilting module (respectively, a 1-star module) and generates both and (respectively, generates ), where is an injective cogenerator in the category of all left A-modules. These extend results in [I. Assem, N. Marmaridis, Tilting modules over split-by-nilpotent extensions, Comm. Algebra 26 (1998) 1547–1555; K.R. Fuller, *-Modules over ring extensions, Comm. Algebra 25 (1997) 2839–2860] by removing the restrictions on R and Q.     

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.     

Topological complexity is a fibrewise L–S category

Topological complexity of a space B is introduced by M. Farber to measure how much complex the space is, which is first considered on a configuration space of a motion planning of a robot arm. We also consider a stronger version of topological complexity with an additional condition: in a robot motion planning, a motion must be stasis if the initial and the terminal states are the same. Our main goal is to show the equalities and , where d(B)=B×B is a fibrewise pointed space over B whose projection and section are given by the canonical projection to the second factor and the diagonal. In addition, our method in studying fibrewise L–S category is able to treat a fibrewise space with singular fibres.