نتایج جستجو برای: aut ecology
تعداد نتایج: 54325 فیلتر نتایج به سال:
Let G be a connected simple cubic graph; Aut G denotes its automorphism group. Let n be half the number of vertices of G. We define the arithmetic genus of a (possibly disconnected) graph as e−v+1 where e is the number of edges, v the number of vertices of G). For a connected simple cubic graph, g = n+1. The definition of arithmetic genus is motivated by the following: to a projective nodal cur...
The term strong approximation is used to describe phenomena where an arithmetic group as well as all of its Zariski dense subgroups have a large image in the congruence quotients. We exhibit analogues of such phenomena in a probabilistic, rather than arithmetic, setting. Let T be the binary rooted tree, Aut(T ) its automorphism group. To a given m-tuple a = {a1, a2, . . . , am} ∈ Aut(T ) we ass...
We consider the problem of uniqueness of certain simultaneity structures in flat spacetime. Absolute simultaneity is specified to be a nontrivial equivalence relation which is invariant under the automorphism group Aut of spacetime. Aut is taken to be the identity-component of either the inhomogeneous Galilei group or the inhomogeneous Lorentz group. Uniqueness of standard simultaneity in the f...
We strengthen a classical result of Sabidussi giving a necessary and sufficient condition on two graphs, X and Y , for the automorphsim group of the wreath product of the graphs, Aut(X o Y ) to be the wreath product of the automorphism groups Aut(X) o Aut(Y ). We also generalize this to arrive at a similar condition on color digraphs. The main purpose of this paper is to revisit a well-known an...
We give upper bounds on the order of the automorphism group of a simple graph In this note we present some upper bounds on the order of the automorphism group of a graph, which is assumed to be simple, having no loops or multiple edges. Somewhat surprisingly, we did not find such bounds in the literature and the goal of this paper is to fill this gap. As a matter of fact, implicitly such bounds...
Let $ k be a field, G totally ordered abelian group and \mathbb K = k((G)) the maximal field of generalised power series, endowed with canonical valuation v $. We study \mathrm{-Aut} preserving automorphisms subfield k(G)\subseteq K\subseteq $, where k(G) is fraction ring k[G] Under assumption that satisfies two lifting properties we are able to generalise refine Hofberger's decomposition \math...
BACKGROUND Multidisciplinary antimicrobial utilization teams (AUTs) have been proposed as a mechanism for improving antimicrobial use, but data on their efficacy remain limited. OBJECTIVE To determine the impact of an AUT on antimicrobial use at a teaching hospital. DESIGN Randomized controlled intervention trial. SETTING A 953-bed, public, university-affiliated, urban teaching hospital. ...
BACKGROUND Although deviations in intraoperative blood pressure are assumed to be associated with postoperative mortality, critical blood pressure thresholds remain undefined. Therefore, the authors estimated the intraoperative thresholds of systolic blood pressure (SBP), mean blood pressure (MAP), and diastolic blood pressure (DBP) associated with increased risk-adjusted 30-day mortality. ME...
Let Mg be the moduli space of smooth, genus g curves over an algebraically closed field K of zero characteristic. Denote by Mg(G) the subset of Mg of curves δ such that G (as a finite non-trivial group) is isomorphic to a subgroup of Aut(δ) and let M̃g(G) be the subset of curves δ such that G ∼= Aut(δ) where Aut(δ) is the full automorphism group of δ. Now, for an integer d ≥ 4, let MPl g be the ...
Let S be a set of transpositions such that the girth of the transposition graph of S is at least 5. It is shown that the automorphism group of the Cayley graph of the permutation group H generated by S is the semidirect product R(H) ⋊ Aut(H,S), where R(H) is the right regular representation of H and Aut(H,S) is the set of automorphisms of H that fixes S setwise. Furthermore, if the connected co...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید