Results 1  10
of
3,471
INFINITE FAMILIES OF SOLUTIONS OF THE EQUATION ...
, 1998
"... We give explicit formulas providing two new infinite families of couples of binomial coefficients whose ratio is 2. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We give explicit formulas providing two new infinite families of couples of binomial coefficients whose ratio is 2.
AN INFINITE FAMILY OF SUMMATION IDENTITIES
, 2002
"... Abstract. Theta functions have historically played a prominent role in number theory. One such role is the construction of modular forms. In this work, a generalized theta function is used to construct an infinite family of summation identities. Our results grew out of some observations noted during ..."
Abstract
 Add to MetaCart
Abstract. Theta functions have historically played a prominent role in number theory. One such role is the construction of modular forms. In this work, a generalized theta function is used to construct an infinite family of summation identities. Our results grew out of some observations noted
Infinite families of new semifields
, 2008
"... We construct six new infinite families of finite semifields, all of which are twodimensional over their left nuclei. We give constructions for both even and odd characteristics when the left nucleus has odd dimension over the center. The characteristic is odd in the one family in which the left nuc ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
We construct six new infinite families of finite semifields, all of which are twodimensional over their left nuclei. We give constructions for both even and odd characteristics when the left nucleus has odd dimension over the center. The characteristic is odd in the one family in which the left
Infinite families of tight regular tournaments
, 2007
"... In this paper, we construct infinite families of tight regular tournaments. In particular, we prove that two classes of regular tournaments, tame molds and ample tournaments are tight. We exhibit an infinite family of 3dichromatic tight tournaments. With this family we positively answer to one case ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
In this paper, we construct infinite families of tight regular tournaments. In particular, we prove that two classes of regular tournaments, tame molds and ample tournaments are tight. We exhibit an infinite family of 3dichromatic tight tournaments. With this family we positively answer to one
An Infinite Family of 7Designs
, 1999
"... We study designs in the binary affine space invariant under the affine group in its 3transitive action. The main result is a family 7 \Gamma (2 n ; 8; 45); n 6 of nonsimple designs. We also obtain 5 \Gamma (2 n ; 6; 3) for every n 3 and 5 \Gamma (2 n ; 7; 7(v \Gamma 16)=2) for every even n ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We study designs in the binary affine space invariant under the affine group in its 3transitive action. The main result is a family 7 \Gamma (2 n ; 8; 45); n 6 of nonsimple designs. We also obtain 5 \Gamma (2 n ; 6; 3) for every n 3 and 5 \Gamma (2 n ; 7; 7(v \Gamma 16)=2) for every even
AN INFINITE FAMILY OF GROMOLLMEYER SPHERES
, 2006
"... Abstract. We construct a new infinite family of models of exotic 7spheres. These models are direct generalizations of the GromollMeyer sphere. From their symmetries, geodesics and submanifolds half of them are closer to the standard 7sphere than any other known model for an exotic 7sphere. 1. ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Abstract. We construct a new infinite family of models of exotic 7spheres. These models are direct generalizations of the GromollMeyer sphere. From their symmetries, geodesics and submanifolds half of them are closer to the standard 7sphere than any other known model for an exotic 7sphere. 1.
On an Infinite Family of Solvable Hanoi Graphs
"... Abstract. The Tower of Hanoi problem is generalized by placing pegs on the vertices of a given directed graph G with two distinguished vertices, S and D, and allowing moves only along arcs of this graph. An optimal solution for such a graph G is an algorithm that completes the task of moving a tower ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
tower of any given number of disks from S to D in a minimal number of disk moves. In this article we present an algorithm which solves the problem for two infinite families of graphs, and prove its optimality. To the best of our knowledge, this is the first optimality proof for an infinite family
Infinite families of links with trivial Jones polynomial
"... For each k >= 2, we exhibit infinite families of prime kcomponent links with Jones polynomial equal to that of the kcomponent unlink. ..."
Abstract

Cited by 33 (14 self)
 Add to MetaCart
For each k >= 2, we exhibit infinite families of prime kcomponent links with Jones polynomial equal to that of the kcomponent unlink.
Results 1  10
of
3,471