Search results

In [[discrete mathematics]], a '''discrete fixed-point''' is a [[fixed point (mathematics)|fixed-point]] for functions defined on finite sets, typically subsets of t ...-year=2004 (FBA working paper no. 210, Yokohama National University)|title=Discrete fixed point analysis and its applications|journal=Journal of Fixed Point Th ...

...bout convergence of Fourier series}}'''Wiener–Lévy theorem''' is a theorem in [[Fourier analysis]], which states that a function of an absolutely converg ...Wiener |first=N. |year=1932 |title=Tauberian Theorems |journal=[[Annals of Mathematics]] |volume=33 |issue=1 |pages=1–100 |jstor=1968102 |doi=10.2307/1968102}}</r ...

...mates for the error term, determining how close to [[Uniform distribution (discrete)|uniform]] the distributions are. be a weighted count of primes in the arithmetic progression ''a''&nbsp;mod&nbsp;''q''. We have ...

{{Short description|Mathematical construction in topology}} ...ssociated with a [[Polish space]]. Except in the case of [[discrete space|discrete]] Polish spaces, the standard Borel space is unique, up to [[isomorphism]] ...

...version of the theorem states that, if a finite set of red and blue points in the [[Euclidean plane]] has the property that, for every four points, there {{quote|If sheep and goats are grazing in a field and for every four animals there exists a line separating the sheep ...

...s | jstor=2373814 | mr=0427627 | year=1976 | journal=[[American Journal of Mathematics]] | issn=0002-9327 | volume=98 | issue=3 | pages=739–749 | doi=10.2307/2373 The inequality states that if ''A'' and ''B'' generate a non-elementary discrete subgroup of the SL₂('''C'''), then ...

{{short description|Every set of lattice points in the plane has a large subset whose centroid is also a lattice point}} ...]] whose [[centroid]] is also a lattice point. It was proved independently in the autumn of 2003 by [[Christian Reiher]], then an undergraduate student, ...

...olutely continuous distributions with respect to the [[Lebesgue measure]] (in other words, one of the players is forbidden to use a [[pure strategy]]). ...phi_k(x)</math> are continuous functions. For <math> \mu \in M_X, \lambda \in M_Y</math>, define ...

...by [[Joseph O'Rourke (professor)|Joseph O'Rourke]], and published in 1987 in the International Series of Monographs on Computer Science of the [[Oxford ...|franklin}} More generally, the book has as a theme "the interplay between discrete and computational geometry".{{r|avis}} ...

...a special case of the [[Burkholder-Davis-Gundy inequality]] in the case of discrete-time martingales. ...fonctions indépendantes. ''Fund. Math.'', 28:60&ndash;90, 1937. Reprinted in Józef Marcinkiewicz, ''Collected papers'', edited by Antoni Zygmund, Panstw ...

...the number of constraints of the problem and [[fixed-parameter tractable]] in its {{nowrap|dimension.{{r|ads}}}} The same theorem applies more generally ...s]] David E. Bell and [[Herbert Scarf]], who both rediscovered it {{nowrap|in 1977{{r|bell|scarf}}}} and pointed out its applications to integer {{nowrap ...

{{short description|Conjecture in group theory}} ...the length of any [[orbit (group theory)|orbit]] of <math>G_\alpha</math> in the set <math>S \setminus \{\alpha\}</math>. ...

...ropriate scaling is distributed according to the same family. They are the discrete analogue of [[stable distribution|continuous-stable distributions]]. ...rete-stable distributions have been used in numerous fields, in particular in [[scale-free networks]] such as the [[internet]] and [[social networks]]<re ...

...nsions require characteristic 0.<ref>{{Springer|id=B/b015770|title=Bertini theorems}}</ref><ref>Hartshorne, Ch. III.10.</ref> ...ooth quasi-projective variety over an algebraically closed field, embedded in a [[algebraic geometry of projective spaces|projective space]] <math>\math ...

{{dablink|For other theorems of Jacobi see [[Jacobi's theorem (disambiguation)]].}} In [[number theory]], '''Jacobi's four-square theorem''' gives a formula for t ...

{{short description|Sufficient condition for a Hamiltonian cycle in a graph, based on its vertex's degrees}} ...a]], a protégé of [[Paul Erdős]] born in 1947, who discovered this theorem in 1962. ...

...s. It is named after [[Brian Alspach]], who posed it as a research problem in 1981. A [[mathematical proof|proof]] was published by {{harvs|first1=Darryn ...ber of cycles that include that vertex, an even number. And for the cycles in a disjoint cycle cover to have a given collection of lengths, ...

{{Short description|Class of algebraic theorems}} '''Local rigidity''' theorems in the theory of discrete subgroups of [[Lie group]]s are results which show that small deformations ...

In [[mathematics]], '''Mnëv's universality theorem''' is a result in the intersection of [[combinatorics]] and [[algebraic geometry]] used to re : Let <math>V</math> be a semialgebraic variety in <math>{\mathbb R}^n</math> defined over the integers. Then <math>V</math> i ...

{{short description|All submatrices of a discrete Fourier transform matrix of prime length are invertible}} ...y''' was originally a conjecture made by [[Alexander Ostrowski|Ostrowski]] in the context of [[Lacunary function|lacunary series]]. ...