Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userThe binary $q$-analogue of the Fano plane has a trivial automorphism group
114
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
A $q$-analogue of a $t$-design is a set $S$ of subspaces (of dimension $k$) of a finite vector space $V$ over a field of order $q$ such that each $t$ subspace is contained in a constant $lambda$ number of elements of $S$. The smallest nontrivial feasible parameters occur when $V$ has dimension $7$, $t=2$, $q=2$, and $k=3$; which is the $q$-analogue of a $2$-$(7,3,1)$ design, the Fano plane. The existence of the binary $q$-analogue of the Fano plane has yet to be resolved, and it was shown by Kiermaier et al. (2016) that such a configuration must have an automorphism group of order at most $2$. We show that the binary $q$-analogue of the Fano plane has a trivial automorphism group.
rate research
Read More
We prove that K-polystable log Fano pairs have reductive automorphism groups. In fact, we deduce this statement by establishing more general results concerning the S-completeness and $Theta$-reductivity of the moduli of K-semistable log Fano pairs. Assuming the conjecture that K-semistability is an open condition, we prove that the Artin stack parametrizing K-semistable Fano varieties admits a separated good moduli space.
We give upper bounds on the order of the automorphism group of a simple graph
We answer a question posed by Michael Aissen in 1979 about the $q$-analogue of a classical theorem of George Polya (1922) on the algebraicity of (generalized) diagonals of bivariate rational power series. In particular, we prove that the answer to Aissens question, in which he considers $q$ as a variable, is negative in general. Moreover, we show that the answer is positive if and only if $q$ is a root of unity.
In this paper we shall survey the various methods of evaluating Hankel determinants and as an illustration we evaluate some Hankel determinants of a q-analogue of Catalan numbers. Here we consider $frac{(aq;q)_{n}}{(abq^{2};q)_{n}}$ as a q-analogue of Catalan numbers $C_{n}=frac1{n+1}binom{2n}{n}$, which is known as the moments of the little q-Jacobi polynomials. We also give several proofs of this q-analogue, in which we use lattice paths, the orthogonal polynomials, or the basic hypergeometric series. We also consider a q-analogue of Schroder Hankel determinants, and give a new proof of Moztkin Hankel determinants using an addition formula for ${}_2F_{1}$.
Zero forcing is a combinatorial game played on a graph where the goal is to start with all vertices unfilled and to change them to filled at minimal cost. In the original variation of the game there were two options. Namely, to fill any one single vertex at the cost of a single token; or if any currently filled vertex has a unique non-filled neighbor, then the neighbor is filled for free. This paper investigates a $q$-analogue of zero forcing which introduces a third option involving an oracle. Basic properties of this game are established including determining all graphs which have minimal cost $1$ or $2$ for all possible $q$, and finding the zero forcing number for all trees when $q=1$.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
