8 citations · 16 across the 16 of their papers we have counts for
17 papers
Intersecting families of permutations with a fixed number of cycles
Venkata Raghu Tej Pantangi
Let denote the set of permutations on with exactly cycles. A family is said to be intersecting if $…
Hilton-Milner Theorem for the -independent sets in a union of cliques
Karen Gunderson, Karen Meagher, Joy Morris +1
We give a Hilton-Milner Theorem for the -independent sets in the graph that is the union of copies of . That is, we determine the maximum intersecting families of -indep…
Perfect and multiple state transfer in oriented Cayley graphs
Ada Chan, Venkata Raghu Tej Pantangi, Andriaherimanana Sarobidy Razafimahatratra +1
We study perfect state transfer and multiple state transfer in oriented normal Cayley graphs. We construct examples in a variety of groups, ranging from abelian to nonsolvable, and…
A new measure of robustness of Erdős--Ko--Rado Theorems on permutation groups
Karen Gunderson, Karen Meagher, Joy Morris +2
In this paper we introduce a new way of measuring the robustness of Erdős--Ko--Rado (EKR) Theorems on permutation groups. EKR-type results can be viewed as results about the indepe…
Intersecting Families of Spanning Trees
Peter Frankl, Glenn Hurlbert, Ferdinand Ihringer +4
A family of spanning trees of the complete graph on vertices is \emph{-intersecting} if any two members have a forest on edges in common. We prove an…
Perfect state transfer in graphs related to linear groups in two dimensions
Venkata Raghu Tej Pantangi, Peter Sin
We construct families of graphs from linear groups , and , where is an odd prime power, with the property that the cont…
Intersecting subsets in finite permutation groups
CaiHeng Li, Venkata Raghu Tej Pantangi, Shujiao Song +1
Let be transitive, and let be an intersecting subset, namely, the ratio of any elements fixes some point. An EKR-type problem i…
All -transitive groups satisfy the strict-EKR property
Venkata Raghu Tej Pantangi
A subset of a transitive permutation group is said to be an intersecting set if, for every , there is an such that $g_{1}…
Cameron-Liebler sets in permutation groups
Jozefien D'haeseleer, Karen Meagher, Venkata Raghu Tej Pantangi
Consider a group acting on a set , the vector is a vector with the entries indexed by the elements of , and the -entry is 1 if maps to , and zero…
Induced forests in some distance-regular graphs
Karen Gunderson, Karen Meagher, Joy Morris +1
In this article, we study the order and structure of the largest induced forests in some families of graphs. First we prove a variation of the ratio bound that gives an upper bound…
On the EKR Module property
Cai Heng Li, Venkata Raghu Tej
In the recent years, the generalization of the Erdős-Ko-Rado (EKR) theorem to permutation groups has been of much interest. A transitive group is said to satisfy the EKR-module pro…
Erdős-Ko-Rado problems for permutation groups
Cai Heng Li, Shu Jiao Song, Venkata Raghu Tej Pantangi
In this paper, we study intersecting sets in primitive and quasiprimitive permutation groups. Let be a transitive permutation group, and an inte…
Some formulae for coefficients in restricted -products
Ankush Goswami, Venkata Raghu Tej Pantangi
In this paper, we derive some formulae involving coefficients of polynomials which occur quite naturally in the study of restricted partitions. Our method involves a recently disco…
On sums of coefficients of polynomials related to the Borwein conjectures
Ankush Goswami, Venkata Raghu Tej Pantangi
Recently, Li obtained an asymptotic formula for a certain partial sum involving coefficients for the polynomial in the First Borwein conjecture. As a consequence, he showed the pos…
Difference families, skew Hadamard matrices, and Critical groups of doubly regular tournaments
Venkata Raghu Tej Pantangi
In this paper we investigate the structure of the critical groups of doubly regular tournaments (DRTs) associated with skew Hadamard difference families (SDFs) with one, two, or fo…
Critical groups of van Lint-Schrijver Cyclotomic Strongly Regular Graphs
Venkata Raghu Tej Pantangi
The \emph{critical} group of a finite connected graph is an abelian group defined by the Smith normal form of its Laplacian. Let be a power of a prime and be a multiplicati…
Smith and Critical groups of Polar Graphs
Venkata Raghu Tej Pantangi, Peter Sin
We compute the elementary divisors of the adjacency and Laplacian matrices of families of polar graphs. These graphs have as vertices the isotropic one-dimensional subspaces of fin…