Search Results for ""

A partial solution to the Erdős squarefree conjecture which states that the binomial coefficient (2n; n) is never squarefree for all sufficiently large n>=n_0. Sárkőzy (1985) ...

A scale-free network is a connected graph or network with the property that the number of links k originating from a given node exhibits a power law distribution ...

There exists a positive integer s such that every sufficiently large integer is the sum of at most s primes. It follows that there exists a positive integer s_0>=s such that ...

Let the minimal length of an addition chain for a number n be denoted l(n). Then the Scholz conjecture, also called the Scholz-Brauer conjecture or Brauer-Scholz conjecture, ...

An algorithm for determining the order of an elliptic curve E/F_p over the finite field F_p.

The score function u(theta) is the partial derivativeof the log-likelihood function F(theta)=lnL(theta), where L(theta) is the standard likelihood function. Defining the ...

11 21 8 61 22 58 241 52 328 444 1201 114 1452 4400 3708 7201 240 5610 32120 58140 33984 5040 (1) The second-order Eulerian triangle (OEIS A008517) is the number triangle ...

The second Zagreb index for a graph with vertex count n and vertex degrees d_i for i=1, ..., n is defined by Z_2=sum_((i,j) in E(G))d_id_j, where E(G) is the edge set of G.

An orientable surface with one boundary component such that the boundary component of the surface is a given knot K. In 1934, Seifert proved that such a surface can be ...

Let A be a C^*-algebra. An element a in A is called self-adjoint if a^*=a. For example, the real functions of the C^*-algebra of C([a,b]) of continuous complex-valued ...