نتایج جستجو برای: maximal n prime of 0

تعداد نتایج: 21396174  

Journal: :bulletin of the iranian mathematical society 2014
xiaoxiang yu dengyin wang

suppose $g$ is a split connected‎ ‎reductive orthogonal or symplectic group over an infinite field‎ ‎$f,$ $p=mn$ is a maximal parabolic subgroup of $g,$ $frak{n}$ is‎ ‎the lie algebra of the unipotent radical $n.$ under the adjoint‎ ‎action of its stabilizer in $m,$ every maximal prehomogeneous‎ ‎subspaces of $frak{n}$ is determined‎.

Journal: :Electr. J. Comb. 2011
Juhani Nieminen Matti Peltola Pasi Ruotsalainen

Two characterizations of hypercubes are given: 1) A graph is a hypercube if and only if it is antipodal and bipartite (0, 2)-graph. 2) A graph is an nhypercube if and only if there are n pairs of prime convexes, the graph is a prime convex intersection graph, and each intersection of n prime convexes (no one of which is from the same pair) is a vertex.

2008
Isabel Goffa

Let S be a semigroup and K be a field. A K-space K[S], with basis S and with multiplication extending, in a natural way, the operation on S, is called a semigroup algebra. It remains an open problem to characterize semigroup algebras that are a prime Noetherian maximal order. In this thesis, we give an answer to the problem for a large class of cancellative semigroups and we illustrate these re...

2010
J. G. HORNE

2. Primary ideals in C(X). C(X) denotes the ring of real-valued continuous functions on the topological space X, under ordinary pointwise addition and multiplication. By a primary ideal we mean an ideal which is contained in at most one maximal ideal. An O-ideal is an ideal / such that for each pair/i,/2G/ there exists eEI, depending on/i and f2, such that/<«=/.-, for i = l, 2 [7; 4]. A prime-l...

2008
Phuong Nguyen

We study the problem of proving in weak theories of Bounded Arithmetic the theorem that there are arbitrarily large prime numbers. We show that the theorem can be proved by some “minimal” reasoning (i.e., in the theory I∆0) using concepts such as (the logarithm) of a binomial coefficient. In fact we prove Bertrand’s Postulate (that there is at least a prime number between n and 2n, for all n > ...

2009
Zhi-Wei Sun ZHI-WEI SUN

Let n be a positive odd integer and let p > n + 1 be a prime. We mainly derive the following congruence: ∑ 0<i1<···<in<p ( i1 3 ) (−1)i1 i1 · · · in ≡ 0 (mod p).

2015
LAURE FLAPAN

This paper studies the possible Hodge groups of simple polarizable Q-Hodge structures with Hodge numbers (n, 0, . . . , 0, n). In particular, it generalizes earlier work of Ribet and MoonenZarhin to completely determine the possible Hodge groups of such Hodge structures when n is equal to 1, 4, or a prime p. In addition, the paper determines possible Hodge groups, under certain conditions on th...

2012
JAMES PARSON

The purpose of these notes is to illustrate the descent technique used in [Maz72] and [Maz77] to bound the rank of abelian varieties A/Q; this method is used in [Maz77] to prove that the Eisenstein quotient of J0(N)/Q (where N is a prime number) has rank 0. We begin with a brief review of the standard method of descent. We then explain how fppf cohomology can be used following this model to pro...

Journal: :Electr. J. Comb. 2013
Hao Pan

For α, β, γ, δ ∈ Z and ν = (α, β, γ, δ), the q-Fibonacci numbers are given by F ν 0 (q) = 0, F ν 1 (q) = 1 and F ν n+1(q) = q αn−βF ν n (q) + q γn−δF ν n−1(q) for n > 1. And define the q-Lucas number Ln(q) = F ν n+1(q)+ q γ−δF ν∗ n−1(q), where ν∗ = (α, β− α, γ, δ − γ). Suppose that α = 0 and γ is prime to n, or α = γ is prime to n. We prove that Ln(q) ≡ (−1) (mod Φn(q)) for n > 3, where Φn(q) i...

Journal: :caspian journal of mathematical sciences 0
n. nyamoradi department of mathematics, faculty of sciences, razi university, 67149 kermanshah, iran.

in this work, by employing the krasnosel&apos;skii fixed point theorem, we study the existence of positive solutions of a three-point boundary value problem for the following fourth-order differential equation begin{eqnarray*} left { begin{array}{ll} u^{(4)}(t) -f(t,u(t),u^{prime prime }(t))=0 hspace{1cm} 0 leq t leq 1, & u(0) = u(1)=0, hspace{1cm} alpha u^{prime prime }(0) - beta u^{prime prim...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید