Zobrazeno 1 - 10
of 32
pro vyhledávání: '"Pantangi, Venkata Raghu Tej"'
We construct families of graphs from linear groups $\mathrm{SL}(2,q)$, $\mathrm{GL}(2,q)$ and $\mathrm{GU}(2,q^2)$, where $q$ is an odd prime power, with the property that the continuous-time quantum walks on the associated networks of qubits admit p
Externí odkaz:
http://arxiv.org/abs/2408.14807
Autor:
Gunderson, Karen, Meagher, Karen, Morris, Joy, Pantangi, Venkata Raghu Tej, Shirazi, Mahsa N.
The Erd\H{o}s--Ko--Rado (EKR) theorem and its generalizations can be viewed as classifications of maximum independent sets in appropriately defined families of graphs, such as the Kneser graph $K(n,k)$. In this paper, we investigate the independence
Externí odkaz:
http://arxiv.org/abs/2406.15739
A subset (subgroup) $S$ of a transitive permutation group $G\leq Sym(\Omega)$ is called an intersecting subset (subgroup, resp.) if the ratio $xy^{-1}$ of any elements $x,y\in S$ fixes some point. A transitive group is said to have the EKR property i
Externí odkaz:
http://arxiv.org/abs/2403.17783
Autor:
Pantangi, Venkata Raghu Tej
A subset $S$ of a transitive permutation group $G \leq \mathrm{Sym}(n)$ is said to be an intersecting set if, for every $g_{1},g_{2}\in S$, there is an $i \in [n]$ such that $g_{1}(i)=g_{2}(i)$. The stabilizer of a point in $[n]$ and its cosets are i
Externí odkaz:
http://arxiv.org/abs/2311.13055
Consider a group $G$ acting on a set $\Omega$, the vector $v_{a,b}$ is a vector with the entries indexed by the elements of $G$, and the $g$-entry is 1 if $g$ maps $a$ to $b$, and zero otherwise. A $(G,\Omega)$-Cameron-Liebler set is a subset of $G$,
Externí odkaz:
http://arxiv.org/abs/2308.08254
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 order of the largest induced forest in a graph. Next we define
Externí odkaz:
http://arxiv.org/abs/2301.05207
Publikováno v:
In Discrete Applied Mathematics 31 March 2024 346:290-300
In this paper, we study intersecting sets in primitive and quasiprimitive permutation groups. Let $G \leqslant \mathrm{Sym}(\Omega)$ be a transitive permutation group, and ${S}$ an intersecting set. Previous results show that if $G$ is either 2-trans
Externí odkaz:
http://arxiv.org/abs/2006.10339
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 discovered sieve technique by Li and Wan (Sci. China. Math. 2010). Based on
Externí odkaz:
http://arxiv.org/abs/2005.01067
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 positivity of this sum. His result was based on a sieving principle disco
Externí odkaz:
http://arxiv.org/abs/2004.08954