Search Results for ""

One of the 24 7-polyiamonds.

A polynomial map phi_(f), with f=(f_1,...,f_n) in (K[X_1,...,X_n])^m in a field K is called invertible if there exist g_1,...,g_m in K[X_1,...,x_n] such that ...

The Jacobsthal polynomials are the w-polynomials obtained by setting p(x)=1 and q(x)=2x in the Lucas polynomial sequence. The first few Jacobsthal-Lucas polynomials are ...

A framework is called "just rigid" if it is rigid, but ceases to be so when any single bar is removed. Lamb (1928, pp. 93-94) proved that a necessary (but not sufficient) ...

If f_1,...,f_m:R^n->R are exponential polynomials, then {x in R^n:f_1(x)=...f_n(x)=0} has finitely many connected components.

A generalization of the concept of set unions and intersections.

A discrete distribution of a random variable such that every possible value can be represented in the form a+bn, where a,b!=0 and n is an integer.

A lens space L(p,q) is the 3-manifold obtained by gluing the boundaries of two solid tori together such that the meridian of the first goes to a (p,q)-curve on the second, ...

A linear code over a finite field with q elements F_q is a linear subspace C subset F_q^n. The vectors forming the subspace are called codewords. When codewords are chosen ...

The log-series distribution, also sometimes called the logarithmic distribution (although this work reserves that term for a distinct distribution), is the distribution of ...