English
Related papers

Related papers: On the Cameron-Praeger Conjecture

200 papers

Dave Benson conjectured in 2020 that if $G$ is a finite $2$-group and $V$ is an odd-dimensional indecomposable representation of $G$ over an algebraically closed field $\Bbbk$ of characteristic $2$, then the only odd-dimensional…

Representation Theory · Mathematics 2023-03-16 George Cao , Kent B. Vashaw

We present constructions and results about GDDs with two groups and block size 6. We study those GDDs in which each block has configuration (s,t), that is in which each block has exactly s points from one of the two groups and t points from…

Combinatorics · Mathematics 2011-05-10 Melissa Keranen , Melanie Laffin

Let $E/\mathbb{Q}$ an elliptic curve with good supersingular reduction at a prime $p\geq 5$, and $K$ an imaginary quadratic field such that the root number of $E$ over $K$ equals $-1$. When $p$ splits in $K$, Castella and Wan formulated the…

Number Theory · Mathematics 2026-05-05 Ashay Burungale , Kâzım Büyükboduk , Antonio Lei

Thomassen (1994) proved that every planar graph is 5-choosable. This result was generalised by {\v{S}}krekovski (1998) and He et al. (2008), who proved that every $K_5$-minor-free graph is 5-choosable. Both proofs rely on the…

Combinatorics · Mathematics 2011-04-15 David R. Wood , Svante Linusson

Let 1_k 0_l denote the (k+l)\times 1 column of k 1's above l 0's. Let q. (1_k 0_l) $ denote the (k+l)xq matrix with q copies of the column 1_k0_l. A 2-design S_{\lambda}(2,3,v) can be defined as a vx(\lambda/3)\binom{v}{2} (0,1)-matrix with…

Combinatorics · Mathematics 2019-09-18 R. P. Anstee , Farzin Barekat

In this article, we provide counterexamples to a conjecture of M. Pellegrini and P. Shumyatsky which states that each coset of the centralizer of an involution in a finite non-abelian simple group $G$ contains an odd order element, unless…

Group Theory · Mathematics 2023-04-26 Rijubrata Kundu , Sumit Chandra Mishra

The problem of finding provably maximal sets of mutually unbiased bases in $\mathbb{C}^d$, for composite dimensions $d$ which are not prime powers, remains completely open. In the first interesting case, $d=6$, Zauner predicted that there…

Quantum Physics · Physics 2021-03-17 Gary McConnell , Harry Spencer , Afaq Tahir

The only open case of Vizing's conjecture that every planar graph with $\Delta\geq 6$ is a class 1 graph is $\Delta = 6$. We give a short proof of the following statement: there is no 6-critical plane graph $G$, such that every vertex of…

Combinatorics · Mathematics 2017-02-27 Ligang Jin , Yingli Kang , Eckhard Steffen

Let G be a complex connected reductive group. The PRV conjecture, which was proved independently by S. Kumar and O. Mathieu in 1989, gives explicit irreducible submodules of the tensor product of two irreducible G-modules. This paper has…

Representation Theory · Mathematics 2019-02-20 Pierre-Louis Montagard , Boris Pasquier , Nicolas Ressayre

We study $6$-transposition groups, i.e. groups generated by a normal set of involutions $D$, such that the order of the product of any two elements from $D$ does not exceed $6$. We classify most of the groups generated by $3$ elements from…

Group Theory · Mathematics 2024-06-21 Vsevolod A. Afanasev , Andrey Mamontov

We present the proof of the cyclic sieving conjectures for generalised non-crossing partitions associated to well-generated complex reflection groups due to Armstrong, respectively to Bessis and Reiner, for the 26 exceptional well-generated…

Combinatorics · Mathematics 2013-10-07 Christian Krattenthaler , Thomas W. Müller

Using evaluations of the difference between consecutive primes we develop another way of estimating of the number of primes in the interval $(n, 2n)$. We also discuss the ultra Cramer conjecture, $p_{n+1} - p_n = O(log^{1+\epsilon}p_n)$…

Number Theory · Mathematics 2015-07-28 Felix Sidokhine

Let $p$ be an odd prime and $S$ a nonabelian finite $p$-group. In [9, 10], they proposed the following conjecture: if $\mathcal{F}$ be a transitive fusion system over a finite $p$-group $S$, then $S$ is either extraspecial of order $p^{3}$…

Group Theory · Mathematics 2024-12-05 Rui Gao , Heguo Liu , Xingzhong Xu , Sheng Yang

We prove a recent conjecture of Beisegel et al. that for every positive integer k, every graph containing an induced P_k also contains an avoidable P_k. Avoidability generalises the notion of simpliciality best known in the context of…

Discrete Mathematics · Computer Science 2019-08-13 Marthe Bonamy , Oscar Defrain , Meike Hatzel , Jocelyn Thiebaut

If G is a finite group, we have proposed new conjectures on the interaction between different primes and their corresponding Brauer principal blocks. In this paper, we give strong support to the validity of these conjectures.

Group Theory · Mathematics 2022-04-08 Gabriel Navarro , Noelia Rizo , A. A. Schaeffer Fry

Assume that R is a semi-local regular ring containing an infinite perfect field, or that R is a semi-local ring of several points on a smooth scheme over an infinite field. Let K be the field of fractions of R. Let H be a strongly inner…

Algebraic Geometry · Mathematics 2009-12-30 I. Panin , V. Petrov , A. Stavrova

In studying Nakayama's 1958 conjecture on rings of infinite dominant dimension, Auslander and Reiten proposed the following generalization: Let Lambda be an Artin algebra and M a Lambda-generator such that Ext^i_Lambda(M,M)=0 for all i \geq…

Commutative Algebra · Mathematics 2007-05-23 Craig Huneke , Graham Leuschke

We prove the Alperin-McKay Conjecture for all $p$-blocks of finite groups with metacyclic, minimal non-abelian defect groups. These are precisely the metacyclic groups whose derived subgroup have order $p$. In the special case $p=3$, we…

Representation Theory · Mathematics 2014-03-21 Benjamin Sambale

The point-line geometry known as a \textit{partial quadrangle} (introduced by Cameron in 1975) has the property that for every point/line non-incident pair $(P,\ell)$, there is at most one line through $P$ concurrent with $\ell$. So in…

Combinatorics · Mathematics 2012-06-26 John Bamberg , Frank De Clerck , Nicola Durante

Coding theory and combinatorial $t$-designs have close connections and interesting interplay. One of the major approaches to the construction of combinatorial t-designs is the employment of error-correcting codes. As we all known, some…

Information Theory · Computer Science 2021-10-11 Can Xiang , Chunming Tang , Qi Liu