نتایج جستجو برای: kung traubs conjecture
تعداد نتایج: 37931 فیلتر نتایج به سال:
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.
Birth order has been examined over a wide variety of dimensions in the context of modern populations. A consistent message has been that it is better to be born first. The analysis of birth order in this paper is different in several ways from other investigations into birth order effects. First, we examine the effect of birth order in an egalitarian, small-scale, kin-based society, which has n...
Used with permission of the University of Illinois Press. No part of this article may be reprinted, reproduced, photocopied, posted on another website, or distributed through any means without prior written permission from the University of Illinois Press.
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 ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید