New permutation statistics: Variation and a variant

For each permutation π we introduce the variation statistic of π, as the total number of elements on the right between each two adjacent elements of π. We modify this new statistic to get a slightly different variant, which behaves more closely like Mahonian statistics such as maj. In this paper we find an explicit formula for the generating function for the number of permutations of length n according to the variation statistic, and for that according to the modified version.     

Wiener, hyper-Wiener, detour and hyper-detour indices of bridge and chain graphs

Given a collection of connected graphs one may build bridge and chain graphs out of them. In this paper it is shown how the Wiener, hyper-Wiener, detour and hyper-detour indices for bridge and chain graphs are determined from the respective indices of the individual graphs. The results obtained are illustrated by some examples.     

Log‐concavity of genus distributions for circular ladders

A well‐known conjecture in topological graph theory says that the genus distribution of every graph is log‐concave. In this paper, the genus distribution of the circular ladder is re‐derived, using overlap matrices and Chebyshev polynomials, which facilitates proof that this genus distribution is log‐concave.     

Comments on the height reducing property

A complex number α is said to satisfy the height reducing property if there is a finite subset, say F, of the ring ? of the rational integers such that ?[α] = F[α]. This property has been considered by several authors, especially in contexts related to self affine tilings and expansions of real numbers in non-integer bases. We prove that a number satisfying the height reducing property, is an algebraic number whose conjugates, over the field of the rationals, are all of modulus one, or all of modulus greater than one. Expecting the converse of the last statement is true, we show some theoretical and experimental results, which support this conjecture.     

Partitions of a set satisfying certain set of conditions

In this paper we present a new combinatorial class enumerated by Catalan numbers. More precisely, we establish a bijection between the set of partitions π₁π₂?π_n of [n] such that π_i+1−π_i≤1 for all i=,1,2…,n−1, and the set of Dyck paths of semilength n. Moreover, we find an explicit formula for the generating function for the number of partitions π₁π₂?π_n of [n] such that either π_i+?−π_i≤1 for all i=1,2,…,n−?, or π_i+1−π_i≤m for all i=1,2,…,n−1.     

Restricted 132-Alternating Permutations and Chebyshev Polynomials

A permutation is said to be alternating if it starts with rise and then descents and rises come in turn. In this paper we study the generating function for the number of alternating permutations on n letters that avoid or contain exactly once 132 and also avoid or contain exactly once an arbitrary pattern on k letters. In several interesting cases the generating function depends only on k and is expressed via Chebyshev polynomials of the second kind.AMS Subject Classification: 05A05, 05A15, 30B70, 42C05.     

Average norms of polynomials

We present an explicit formula for the average -norm over all the polynomials of degree n with coefficients in T, where T is a finite set of complex numbers and α is a positive integer.     

Approximate Controllability of Semilinear Fractional Stochastic Dynamic Systems with Nonlocal Conditions in Hilbert Spaces

A class of dynamic control systems described by semilinear fractional stochastic differential equations of order 1 < q < 2 with nonlocal conditions in Hilbert spaces is considered. Using solution operator theory, fractional calculations, fixed-point technique and methods adopted directly from deterministic control problems, a new set of sufficient conditions for nonlocal approximate controllability of semilinear fractional stochastic dynamic systems is formulated and proved by assuming the associated linear system is approximately controllable. As a remark, the conditions for the exact controllability results are obtained. Finally, an example is provided to illustrate the obtained theory.     

The perimeter of words

We define $\left[k\right]=\{1,2,\dots ,k\}$ to be a (totally ordered) alphabet on $k$ letters. A word $w$ of length $n$ on the alphabet $\left[k\right]$ is an element of ${\left[k\right]}^n$. A word can be represented by a bargraph (i.e., by a column-convex polyomino whose lower edges lie on the $x$-axis) in which the height of the $i$th column equals the size of the $i$th part of the word. Thus these bargraphs have heights which are less than or equal to $k$. We consider the perimeter, which is the number of edges on the boundary of the bargraph. By way of Cramer’s method and the kernel method, we obtain the generating function that counts the perimeter of words. Using these generating functions we find the average perimeter of words of length $n$ over the alphabet $\left[k\right]$. We also show how the mean and variance can be obtained using a direct counting method.