In Zac Thompsons Graphic Novel Relay (2018) sendet das scheinbar aufgeklärte galaktische Imperium der Menschheit Angebot, sich durch die Einpflanzung eines gigantischen Monolithen, homogenisierend auf Kulturen einwirkt, an neu entdeckte Planeten anzuschließen. Planeten, ablehnen, werden zerstört. Die Konformität, dieses System erzeugt, schafft oberflächlich betrachtet eine stabile Welt für die,...

‎we investigate graham higman's paper enumerating $p$-groups‎, ‎ii‎, ‎in which he formulated his famous porc conjecture‎. ‎we are able to simplify some of the theory‎. ‎in particular‎, ‎higman's paper contains five pages of homological algebra which he uses in‎ ‎his proof that the number of solutions in a finite field to a finite set of‎ ‎monomial equations is porc‎. ‎it turns out tha...

We prove a strong form of the Brumer–Stark Conjecture and, as a consequence, a strong form of Rubin’s integral refinement of the abelian Stark Conjecture, for a large class of abelian extensions of an arbitrary characteristic p global field k. This class includes all the abelian extensions K/k contained in the compositum kp∞ := kp · k∞ of the maximal pro-p abelian extension kp/k and the maximal...

We give a polynomial counterexample to a discrete version of the Markus-Yamabe Conjecture and a conjecture of Deng, Meisters and Zampieri, asserting that if F : C → C is a polynomial map with det(JF ) ∈ C∗, then for all λ ∈ R large enough λF is global analytic linearizable. These counterexamples hold in any dimension ≥ 4.

We give a polynomial counterexample to both the Markus-Yamabe Conjecture and the discrete Markus-Yamabe problem for all dimensions ≥ 3.

‎An  oriented perfect path double cover (OPPDC) of a‎ ‎graph $G$ is a collection of directed paths in the symmetric‎ ‎orientation $G_s$ of‎ ‎$G$ such that‎ ‎each arc‎ ‎of $G_s$ lies in exactly one of the paths and each‎ ‎vertex of $G$ appears just once as a beginning and just once as an‎ ‎end of a path‎. ‎Maxov{'a} and Ne{v{s}}et{v{r}}il (Discrete‎ ‎Math‎. ‎276 (2004) 287-294) conjectured that ...

The Erdős–Faber–Lovász conjecture states that if a graph G is the union of n cliques of size n no two of which share more than one vertex, then χ(G) = n. We provide a formulation of this conjecture in terms of maximal partial clones of partial operations on a set.

In this article we define a minor relation, which is stronger than the classical one, but too strong to become a well-quasi-order on the class of finite graphs. Nevertheless, with this terminology we are able to introduce a conjecture, which would imply the Lovasz conjecture and give an interesting insight on the symmetry of vertex-transitive graphs, if true. Though it could become an approach ...

let $g$ be a finite group and let $text{cd}(g)$ be the set of all‎ ‎complex irreducible character degrees of $g$‎. ‎b‎. ‎huppert conjectured‎ ‎that if $h$ is a finite nonabelian simple group such that‎ ‎$text{cd}(g) =text{cd}(h)$‎, ‎then $gcong h times a$‎, ‎where $a$ is‎ ‎an abelian group‎. ‎in this paper‎, ‎we verify the conjecture for‎ ‎${f_4(2)}.$‎