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.     

Zeros of Bernoulli-type functions and best approximations

The zero sets of (D+a)ⁿg(t) with in the (t,a)-plane are investigated for and .The results are used to determine entire interpolations to functions , which give representations for the best approximation and best one-sided approximation from the class of functions of exponential type η>0 to .     

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.     

Probabilistic n-normed spaces, -n-compact sets and -n-bounded sets

In this paper, first we define and study the probabilistic n-normed spaces and -n-compactness, also we prove some theorems and inequalities. In the next section we define -n-boundedness and prove some results in relation between -n-compact and -n-bounded sets in these spaces.     

Erdős–Ko–Rado theorems for permutations and set partitions

Let Sym([n]) denote the collection of all permutations of [n]={1,…,n}. Suppose is a family of permutations such that any two of its elements (when written in its cycle decomposition) have at least t cycles in common. We prove that for sufficiently large n, with equality if and only if is the stabilizer of t fixed points. Similarly, let denote the collection of all set partitions of [n] and suppose is a family of set partitions such that any two of its elements have at least t blocks in common. It is proved that, for sufficiently large n, with equality if and only if consists of all set partitions with t fixed singletons, where B_n is the nth Bell number.     

An upper bound on Jacobi polynomials

Let be an orthonormal Jacobi polynomial of degree k. We will establish the following inequality:

where δ_-1<δ₁ are appropriate approximations to the extreme zeros of . As a corollary we confirm, even in a stronger form, T. Erdélyi, A.P. Magnus and P. Nevai conjecture [T. Erdélyi, A.P. Magnus, P. Nevai, Generalized Jacobi weights, Christoffel functions, and Jacobi polynomials, SIAM J. Math. Anal. 25 (1994) 602–614] by proving that

in the region .     

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 .     

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

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.     

Levels of multi-continued fraction expansion of multi-formal Laurent series

The multi-continued fraction expansion of a multi-formal Laurent series is a sequence pair consisting of an index sequence and a multi-polynomial sequence . We denote the set of the different indices appearing infinitely many times in by H_∞, the set of the different indices appearing in by H₊, and call |H_∞| and |H₊| the first and second levels of , respectively. In this paper, it is shown how the dimension and basis of the linear space over F(z) (F) spanned by the components of are determined by H_∞ (H₊), and how the components are linearly dependent on the mentioned basis.     

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.     

Perfect packings with complete graphs minus an edge

Let denote the graph obtained from K_r by deleting one edge. We show that for every integer r≥4 there exists an integer n₀=n₀(r) such that every graph G whose order n≥n₀ is divisible by r and whose minimum degree is at least contains a perfect -packing, i.e. a collection of disjoint copies of which covers all vertices of G. Here is the critical chromatic number of . The bound on the minimum degree is best possible and confirms a conjecture of Kawarabayashi for large n.     

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 .     

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

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.     

Relative asymptotic of multiple orthogonal polynomials for Nikishin systems

We prove the relative asymptotic behavior for the ratio of two sequences of multiple orthogonal polynomials with respect to the Nikishin systems of measures. The first Nikishin system is such that for each k, σ_k has a constant sign on its compact support consisting of an interval , on which almost everywhere, and a discrete set without accumulation points in . If denotes the smallest interval containing , we assume that Δ_k∩Δ_k+1=0/, k=1,…,m−1. The second Nikishin system is a perturbation of the first by means of rational functions r_k, k=1,…,m, whose zeros and poles lie in .     

Positive solutions of singular p-Laplacian dynamic equations with sign changing nonlinearity

Let be a time scale such that . By the Schauder fixed-point theorem and the upper and lower solution method, we present some existence criteria of the positive solution of m-point singular p-Laplacian dynamic equation with boundary conditions , where φ_p(s)=|s|^p-2s with p>1, is continuous for i=1,2,…,m-1 and nonincreasing if . The nonlinear term may be singular in its dependent variable and is allowed to change sign. Our results are new even for the corresponding differential and difference equations . As an application, an example is given to illustrate our result.