The following pages link to D. V. Chopra (Q607023):
Displaying 50 items.
- (Q587415) (redirect page) (← links)
- Large sets of extended directed triple systems with odd orders (Q607024) (← links)
- Labelings in Cayley digraphs (Q607377) (← links)
- The \(k\)-extensions of some new Mahonian statistics (Q674618) (← links)
- The existence of partitioned generalized balanced tournament designs with block size 3 (Q679234) (← links)
- Statistical design and analysis for intercropping experiments. Volume I: Two crops (Q684283) (← links)
- Combinatorial identities and inverse binomial coefficients (Q696856) (← links)
- Bialgebras of recursive sequences and combinatorial identities (Q696861) (← links)
- The spectrum of optimal strong partially balanced designs with block size five (Q704277) (← links)
- A generalization of the pentomino exclusion problem: dislocation of graphs (Q864131) (← links)
- New infinite families of 3-designs from algebraic curves over \(\mathbb F_q\) (Q875062) (← links)
- Solution to an open problem on the integral sum graphs (Q879676) (← links)
- The existence of perfect \(T(K_{1,2p})\)-triple systems (Q951079) (← links)
- A binary tree decomposition space of permutation statistics (Q1185886) (← links)
- Partition statistics on permutations (Q1191943) (← links)
- Mahonian statistics on labeled forests (Q1191953) (← links)
- Invariant admissible and optimal designs in cubic regression on the \(\nu\)-ball (Q1193807) (← links)
- Compromise designs in heteroscedastic linear models (Q1200664) (← links)
- Monotypical uniformly homogeneous sets of permutations (Q1203515) (← links)
- Group action on a lattice and an application to time series analysis (Q1209651) (← links)
- Optimal balanced \(2^7\) fractional factorial designs of resolution \(v\), with \(N\leq 42\) (Q1223421) (← links)
- Some inequalities for Steiner systems (Q1266399) (← links)
- Statistical design and analysis for intercropping experiments. Vol. 2: Three or more crops (Q1275634) (← links)
- Nonexistence of certain spherical designs of odd strengths and cardinalities (Q1283747) (← links)
- Some \((17q, 17, 2)\) and \((25q, 25, 3)\) BIBD constructions (Q1299907) (← links)
- Simple 8-(40, 11, 1440) designs (Q1302150) (← links)
- A \(q\)-analog of the hook walk algorithm for random Young tableaux (Q1310601) (← links)
- Covering algebras and \(q\)-binomial generating functions (Q1322175) (← links)
- The \(r\)-multipermutations (Q1331143) (← links)
- Almost all linear spaces and partial \(t\)-designs have trivial automorphism groups (Q1336439) (← links)
- Forbidden subsequences (Q1336669) (← links)
- Expressing \((a^ 2+b^ 2+c^ 2+d^ 2)^ 3\) as a sum of 23 sixth powers (Q1337182) (← links)
- \(q\)-analogue of a binomial coefficient congruence (Q1345796) (← links)
- Generating functions for generating trees (Q1348138) (← links)
- A proof of Halpern-Läuchli partition theorem (Q1348762) (← links)
- Matching extension in \(K_{1,r}\)-free graphs with independent claw centers (Q1356714) (← links)
- A note on packing of three forests (Q1356715) (← links)
- Packing bipartite graphs (Q1356720) (← links)
- Some \(E\)-optimal regular graph designs (Q1365330) (← links)
- The combinatorics of discrete self-similarity (Q1373446) (← links)
- 4-blocked Hadamard 3-designs (Q1377817) (← links)
- On blocking sets in a design (Q1377880) (← links)
- A new family of 2-designs over GF\((q)\) admitting SL\(_m(q^l)\) (Q1381333) (← links)
- A construction for resolvable designs and its generalizations (Q1385296) (← links)
- On the number of subgraphs of a specified form embedded in a random graph (Q1397228) (← links)
- On random planar graphs, the number of planar graphs and their triangulations (Q1405106) (← links)
- \(2\)-\((v,k,1)\) designs and PSL\((3,q)\) where \(q\) is odd (Q1430967) (← links)
- A bijective answer to a question of Zvonkin (Q1575087) (← links)
- Umbral calculus and cancellative semigroup algebras (Q1578901) (← links)
- The umbral transfer-matrix method. I: Foundations (Q1584666) (← links)
