Search Results for ""

A weighted adjacency matrix A_f of a simple graph is defined for a real positive symmetric function f(d_i,d_j) on the vertex degrees d_i of a graph as ...

Cantellation, also known as (polyhedron) expansion (Stott 1910, not to be confused with general geometric expansion) is the process of radially displacing the edges or faces ...

Construct a square equal in area to a circle using only a straightedge and compass. This was one of the three geometric problems of antiquity, and was perhaps first attempted ...

A geometric construction done with a movable compass alone. All constructions possible with a compass and straightedge are possible with a movable compass alone, as was ...

Bonato et al. (2014, 2015) defined the burning number of a simple graph as follows. Consider a process called burning involving are discrete time steps. Each node is either ...

Let A(n) denote the number of partitions of n into parts =2,5,11 (mod 12), let B(n) denote the number of partitions of n into distinct parts =2,4,5 (mod 6), and let C(n) ...

Hardy and Littlewood (1914) proved that the sequence {frac(x^n)}, where frac(x) is the fractional part, is equidistributed for almost all real numbers x>1 (i.e., the ...

The Sobolev embedding theorem is a result in functional analysis which proves that certain Sobolev spaces W^(k,p)(Omega) can be embedded in various spaces including ...

The study of efficient algorithms for solving geometric problems. Examples of problems treated by computational geometry include determination of the convex hull and Voronoi ...

An operation on rings and modules. Given a commutative unit ring R, and a subset S of R, closed under multiplication, such that 1 in S, and 0 not in S, the localization of R ...