نتایج جستجو برای: ∆^2-Conjecture

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

Journal: :international journal of group theory 2012
hung p tong-viet thomas p wakefield

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)}.$‎

A GRAOVAC D. VUKIČEVIĆ F. CATALDO O. ORI

This note introduces a new general conjecture correlating the dimensionality dT of an infinite lattice with N nodes to the asymptotic value of its Wiener Index W(N). In the limit of large N the general asymptotic behavior W(N)≈Ns is proposed, where the exponent s and dT are related by the conjectured formula s=2+1/dT allowing a new definition of dimensionality dW=(s-2)-1. Being related to the t...

Journal: :international journal of group theory 2014
daniela bubboloni cheryl e. praeger pablo spiga

let $gamma(s_n)$ be the minimum number of proper subgroups‎ ‎$h_i, i=1‎, ‎dots‎, ‎l $ of the symmetric group $s_n$ such that each element in $s_n$‎ ‎lies in some conjugate of one of the $h_i.$ in this paper we‎ ‎conjecture that $$gamma(s_n)=frac{n}{2}left(1-frac{1}{p_1}right)‎ ‎left(1-frac{1}{p_2}right)+2,$$ where $p_1,p_2$ are the two smallest primes‎ ‎in the factorization of $ninmathbb{n}$ an...

Journal: :international journal of group theory 0
hung p tong-viet north-west university, mafikeng campus thomas p wakefield youngstown state university

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)}.$‎

Journal: :bulletin of the iranian mathematical society 2015
j. zhang h. y. kang l. w. liao

in this paper, we mainly investigate the uniqueness of the entire function sharing a small entire function with its high difference operators. we obtain one results, which can give a negative answer to an uniqueness question relate to the bruck conjecture dealt by liu and yang. meanwhile, we also establish a difference analogue of the bruck conjecture for entire functions of order less than 2, ...

In this paper‎, ‎using the discrete Fourier transform in the finite-dimensional Hilbert space C^n‎, ‎a class of nonRieszable equal norm tight frames is introduced ‎and‎ using this class, a bound for Fiechtinger Conjecture is presented. By the Fiechtinger Conjecture that has been proved recently, for given A,C>0 there exists a universal constant delta>0 independent of $n$ such that every C-equal...

For a given graph G, the square of G, denoted by G2, is a graph with the vertex set V(G) such that two vertices are adjacent if and only if the distance of these vertices in G is at most two. A graph G is called squared if there exists some graph H such that G= H2. A function f:V(G) {0,1,2…, k} is called a coloring of G if for every pair of vertices x,yV(G) with d(x,y)=1 we have |f(x)-f(y)|2 an...

A. Mohammadpouri, F. Pashaie, S. Tajbakhsh,

Chen's biharmonic conjecture is well-known and stays open: The only biharmonic submanifolds of Euclidean spaces are the minimal ones. In this paper, we consider an advanced version of the conjecture, replacing $Delta$ by its extension, $L_1$-operator ($L_1$-conjecture). The $L_1$-conjecture states that any $L_1$-biharmonic Euclidean hypersurface is 1-minimal. We prove that the $L_1$-conje...

In this paper, we mainly investigate the uniqueness of the entire function sharing a small entire function with its high difference operators. We obtain one results, which can give a negative answer to an uniqueness question relate to the Bruck conjecture dealt by Liu and Yang. Meanwhile, we also establish a difference analogue of the Bruck conjecture for entire functions of order less than 2, ...

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

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