Further results on the reverse order law for the Moore-Penrose inverse in rings with involution

We present some equivalent conditions of the reverse order law for the Moore-Penrose inverse in rings with involution, extending some well-known results to more general settings. Then we apply this result to obtain a set of equivalent conditions to the reverse order rule for the weighted Moore-Penrose inverse in C^∗-algebras.     

Further results on the Aanderaa-Rosenberg conjecture

Some results on the “evasiveness” of graph properties are obtained, extending the work of Rivest and Vuillemin. In particular, it is shown that any nontrivial monotone graph property on n vertices is at least $\text{n}{}^2\text{9}\text{-}\text{evasive}$; particular stronger results are obtained for values of n that are powers of primes less than 14. A new result allowing interpolation among n values is obtained, as are some stronger results on restricted classes of properties.     

Further results on L-valued filters

In this paper, we explore the behavior with respect to direct and inverse images of the relations between the different generalizations of filter notion studied in [Gutiérrez García J, de Prada Vicente MA. Characteristic values of ⊤-filters. Fuzzy Sets Syst 2005;56:55–67]. Also, we give sufficient conditions for the existence of an upper bound for those generalizations of filters.     

Further results on logarithmic terraces

Let p be an odd prime, and let x be a primitive root of p. Suppose that we write the elements of ${\mathbb{Z}}_{p-1}$ as $1,2,\dots ,p-1,$ and that, wherever we evaluate $x^l(\mathrm{mod}p)$, we always write it as one of $1,2,\dots ,p-1.$ Let $?=(l_1,\dots ,l_{p-1})$ be a terrace for ${\mathbb{Z}}_{p-1}$. Then $?$ is said to be a logarithmic terrace if $\mathbf{e}=(e_1,\dots ,e_{p-1})$, defined by $e_i\equiv x^{l_i}(\mathrm{mod}p)$, is also a terrace for ${\mathbb{Z}}_{p-1}$. We study properties of logarithmic terraces, in particular investigating terraces which are simultaneously logarithmic for two different primitive roots.     

Further results on pinnacle sets

The study of pinnacle sets has been a recent area of interest in combinatorics. Given a permutation, its pinnacle set is the set of all values larger than the values on either side of it. Largely inspired by conjectures posed by Davis, Nelson, Petersen, and Tenner and also results proven recently by Fang, this paper aims to add to our understanding of pinnacle sets by giving a simpler and more combinatorial proof of a weighted sum formula previously proven by Fang.     

Further results on concordance relations

The purpose of this note is to sharpen the results in an earlier paper [Bouyssou, D., Pirlot, M., 2005. A characterization of concordance relations. European Journal of Operational Research 167 (2), 427–443] giving an axiomatic characterization of concordance relations. We show how the conditions used in this earlier paper can be weakened so as to become independent from the conditions needed to characterize a general conjoint measurement model tolerating intransitive and/or incomplete relations. This leads to a clearer characterization of concordance relations within this general model.     

Further results on the euler and Genocchi numbers

Summary We characterize the ordinary generating functions of the Genocchi and median Genocchi numbers as unique solutions of some functional equations and give a direct algebraic proof of several continued fraction expansions for these functions. New relations between these numbers are also obtained.     

Further results on linear interval equations

As a continuation of my paper “New techniques for the analysis of linear interval equations” [Linear Algebra Appl. 58:273–325 (1984)], the interrelation between interval Gauss elimination and interval iteration is investigated. Main results are a new existence theorem for interval Gauss elimination (in the guise of a perturbation theorem), a convergence and comparison theorem for a general family of interval iteration schemes, and a new method for the calculation of the hull of the solution set of linear interval equations with inverse positive coefficient matrix.     

Further results on supernumary polylogarithmic ladders

Summary With the help of the PARI computer program a number of matters left unresolved from previous work have now been settled. It will be recalled that a ladder is a rational sum of polylogarithms, with predetermined coefficients, of powers of a given algebraic base. The simplest bases considered are the roots in (0, 1) ofu ^p +u ^q = 1 for various integersp andq.. They possess a number of generic results, together with some additional equations, termed supernumary for certain specific values ofp andq. In particular, ladders of the base (see [1]) have been extended to the sixth order, and involve a new index, 60, found by the PARI program. The base from (p, q) = (11, 7) has an additional index 20, and this combines with earlier results to produce a valid ladder. The apparent barren feature of certain equations is now explained in terms of a need to work with a sufficient number of results. It is confirmed that the equation with (p, q) = (5, 3) indeed does not possess any supernumary results.A complete investigation of the smallest Salem number of degree four is given: it possesses results to the 8th order. An introduction is given to similar studies for the smallest known Salem number, which has now been shown to extend to the 16th order.Some ladder results for combined bases are found, with one such formula deducible from a three-variable dilogarithmic functional equation. Formulas of a new type are developed in which summation over conjugate roots enables ladders to be extended fromn = 2 to 3.     

Further results on generalized centro-invertible matrices

Numerical Algorithms - This paper deals with generalized centro-invertible matrices introduced by the authors in Lebtahi et al. (Appl. Math. Lett. 38, 106–109, 2014). As a first result, we...     

Further results on the least eigenvalue of connected graphs

In this paper, we identify within connected graphs of order n and size n+k (with and ) the graphs whose least eigenvalue is minimal. It is also observed that the same graphs have the largest spectral spread if n is large enough.     

Further results on the covering radius of small codes

The minimum number of codewords in a code with t ternary and b binary coordinates and covering radius R is denoted by K(t,b,R). In the paper, necessary and sufficient conditions for K(t,b,R)=M are given for M=6 and 7 by proving that there exist exactly three families of optimal codes with six codewords and two families of optimal codes with seven codewords. The cases M?5 were settled in an earlier study by the same authors. For binary codes, it is proved that K(0,2b+4,b)?9 for b?1. For ternary codes, it is shown that K(3t+2,0,2t)=9 for t?2. New upper bounds obtained include K(3t+4,0,2t)?36 for t?2. Thus, we have K(13,0,6)?36 (instead of 45, the previous best known upper bound).     

Further results on the connectivity of Parseval frame wavelets

In a previous paper, the authors introduced new ideas to treat the problem of connectivity of Parseval frames. With these ideas it was shown that a large set of Parseval frames is arcwise connected. In this article we exhibit a larger class of Parseval frames for which the arcwise connectivity is true. This larger class fails to include all Parseval frames.