a recursive-circulant $g(n; d)$ is defined to be acirculant graph with $n$ vertices and jumps of powers of $d$.$g(n; d)$ is vertex-transitive, and has some strong hamiltonianproperties. $g(n; d)$ has a recursive structure when $n = cd^m$,$1 leq c < d $ [10]. in this paper, we will find the automorphismgroup of some classes of recursive-circulant graphs. in particular, wewill find that the autom...

We describe a new method to represent (partial) recursive functions in type theory. For every recursive definition, we define a co-inductive type of prophecies that characterises the traces of the computation of the function. The structure of a prophecy is a possibly infinite tree, which is coerced by linearisation to a type of partial results defined by applying the delay monad to the co-domai...

The method of partitionable sets for constructing large sets of t-designs have now been used for nearly a decade. The method has resulted in some powerful recursive constructions and also existence results especially for large sets of prime sizes. Perhaps the main feature of the approach is its simplicity. In this paper, we describe the approach and show how it is employed to obtain some of the...

The method of partitionable sets for constructing large sets of t-designs have now been used for nearly a decade. The method has resulted in some powerful recursive constructions and also existence results especially for large sets of prime sizes. Perhaps the main feature of the approach is its simplicity. In this paper, we describe the approach and show how it is employed to obtain some of the...

The multiple-recursive matrix method for generating pseudorandom vectors was introduced by Niederreiter (Linear Algebra Appl. 192 (1993), 301-328). We propose an algorithm for finding an efficient primitive multiplerecursive matrix method. Moreover, for improving the linear complexity, we introduce a tweak on the contents of the primitive multiple-recursive matrix method.

A recursive algorithm for the equivariant method of moving frames, for both finite-dimensional Lie group actions and Lie pseudo-groups, is developed and illustrated by several examples of interest. The recursive method enables one avoid unwieldy symbolic expressions that complicate the treatment of large scale applications of the equivariant moving frame method.

this paper analyzes renewal input state dependent queue with $n$- policy wherein the server takes exactly one vacation. using the supplementary variable technique and recursive method, we derive the steady state system length distributions at various epochs. various performance measures has been presented. finally, some numerical  computations in the form of graphs are presented to show the par...

In this paper, we present subcaching, a method for reducing the size of the caches in the recursive decomposition while maintaining the runtime of recursive conditioning with complete caching. We also demonstrate a heuristic for constructing recursive decompositions that improves the effects of subcaching, and show empirically that the savings in space is quite substantial, with very little eff...

We propose a program analysis method for proving termination of recursive programs. The analysis is based on a reduction of termination to two separate problems: reachability of recursive programs, and termination of non-recursive programs. Our reduction works through a program transformation that modifies the call sites and removes return edges. In the new, non-recursive program, a procedure c...