TOPICS
Search

Search Results for ""


51 - 60 of 13135 for Combinatorial AnalysisSearch Results
Young's geometry is a finite geometry which satisfies the following five axioms: 1. There exists at least one line. 2. Every line of the geometry has exactly three points on ...
Game theory is a branch of mathematics that deals with the analysis of games (i.e., situations involving parties with conflicting interests). In addition to the mathematical ...
In the technical combinatorial sense, an a-ary necklace of length n is a string of n characters, each of a possible types. Rotation is ignored, in the sense that b_1b_2...b_n ...
The Buchstab function omega(u) is defined by the delay differential equation {uomega(u)=1 for 1<=u<=2; (uomega(u))^'=omega(u-1) for u>2 (1) (Panario 1998). It approaches the ...
The study, first developed by Boole, of shift-invariant operators which are polynomials in the differential operator D^~. Heaviside calculus can be used to solve any ordinary ...
Let x:p(x)->xp(x), then for any operator T, T^'=Tx-xT is called the Pincherle derivative of T. If T is a shift-invariant operator, then its Pincherle derivative is also a ...
An operator T which commutes with all shift operators E^a, so TE^a=E^aT for all real a in a field. Any two shift-invariant operators commute.
An operator E such that E^ap(x)=p(x+a).
The operator e^(nut^2/2) which satisfies e^(nut^2/2)p(x)=1/(sqrt(2pinu))int_(-infty)^inftye^(-u^2/(2nu))p(x+u)du for nu>0.
The Schröder number S_n is the number of lattice paths in the Cartesian plane that start at (0, 0), end at (n,n), contain no points above the line y=x, and are composed only ...
1 ... 3|4|5|6|7|8|9 ... 1314 Previous Next

...