Search results

Jump to navigation Jump to search
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • ...name=Kalt>[http://asc.tuwien.ac.at/funkana/woracek/papers/polya.pdf "Polya class theory for Hermite-Biehler functions of finite order"] by [[Michael Kaltenb #''E(z)'' has no zero ([[root of a function|root]]) in the [[upper half-plane]]. ...
    7 KB (1,155 words) - 14:12, 18 August 2023
  • ...o cope with this it is necessary to use some special comparison functions. Class <math>\mathcal{K}</math> functions belong to this family: ...<math>\alpha : [0, a) \rightarrow [0, \infty)</math> is said to belong to class <math>\mathcal{K}</math> if: ...
    2 KB (271 words) - 21:25, 14 February 2020
  • ...odes on a complex surface of given degree. In degree 7, 9, 11, and 13, the upper bound is given by {{harvtxt|Varchenko|1983}}, which is better than the one {| class="wikitable" ...
    3 KB (344 words) - 11:07, 6 January 2024
  • ...in the calculation of [[Inferior limit|lower bounds]] and [[Superior limit|upper bounds]] of {{math|''M''&thinsp;(''n'')}}, with the following results:<ref {| class="wikitable" ...
    6 KB (801 words) - 22:41, 5 January 2024
  • ...tudent, there is a probability of 1/''n'' that the student will attend the class. If at least one student attends, then the teacher must come and his cost i ...#1: the students are uncorrelated: each student decides whether to come to class or not by tossing a coin with probability <math>1/n</math>, independently o ...
    3 KB (516 words) - 13:54, 5 July 2022
  • ...'' for <math>\Omega</math>. The Nevanlinna class includes all the [[Hardy class]]es. ...bounded type in any bounded region. They are also of bounded type in the [[upper half-plane]] (UHP), because a polynomial <math>f(z)</math> of degree ''n'' ...
    8 KB (1,470 words) - 21:08, 11 August 2024
  • ...s to determine the asymptotic behavior of a ratio of gamma functions. The upper bound in this inequality is stronger than the one given above. ...gamma functions. His lower bounds were identical to Wendel's. One of his upper bounds was the one given in the statement above, while the other one was so ...
    6 KB (1,019 words) - 20:40, 1 January 2025
  • ...the '''shattering number''', measures the richness of a [[set family]] or class of functions. It is especially used in the context of [[statistical learnin === Hypothesis-class definition === ...
    11 KB (1,857 words) - 01:13, 20 February 2025
  • ...ives the properties that the individuals must fulfill to be members of the class. Individuals that fulfill the property are called [[Instance (computer scie * ''Person'', the class of all people, or the abstract object that can be described by the criteria ...
    8 KB (1,188 words) - 23:54, 31 December 2024
  • ...cipally polarised abelian varieties given as a stacky quotient of [[Siegel upper half-space]] by the [[symplectic group]] <math>\operatorname{Sp}_{2g}(\math ...consists of complex numbers with positive imaginary part, and is thus the upper half plane, which appears prominently in the study of elliptic curves. In ...
    5 KB (824 words) - 17:32, 19 February 2025
  • ...y also be known as a '''pattern class''', '''closed class''', or simply '''class''' of permutations. ...instance, the [[stack-sortable permutation]]s form a principal permutation class, defined by the forbidden pattern 231. However, some other permutation clas ...
    3 KB (505 words) - 10:51, 26 June 2024
  • {{short description|On jumps of upper numbering filtration of the Galois group of a finite Galois extension}} ...heory]], the '''Hasse–Arf theorem''' is a result concerning jumps of the [[upper numbering]] filtration of the [[Galois group]] of a finite [[Galois extensi ...
    5 KB (854 words) - 11:29, 26 April 2024
  • The log-rank conjecture states that <math>D(f)</math> is also ''upper-bounded'' by a polynomial in the log-rank: for some constant <math>C</math> proved the upper bound ...
    4 KB (494 words) - 11:29, 17 December 2023
  • ...v, [[Igor Pak]], and Alexander Zimin.<ref>{{cite arXiv |eprint=2410.02545 |class=math.CO |author1=Nikita Gladkov |author2=Igor Pak |title=The bunkbed conjec ...dditional edges, termed ''posts'', are added to connect each vertex in the upper bunk with the corresponding vertex in the lower bunk. ...
    7 KB (926 words) - 16:54, 7 January 2025
  • {| class=wikitable align=right {| class=wikitable ...
    3 KB (464 words) - 03:08, 18 December 2024
  • ...[[lower semicontinuous]] payoff function has a value (in this context, an upper (lower) semicontinuous function ''K'' is one in which the set <math>\{P\mid ...along the two discontinuities) to either +1 or&nbsp;−1, making the payoff upper or lower semicontinuous, respectively. If this is done, the game then has ...
    5 KB (801 words) - 17:00, 9 September 2022
  • ...scillatory Integral Over exp(iπx) x^*1/x) Between 1 and Infinity|year=2009|class=math.CA}}</ref><ref>{{cite web|url=http://www.perfscipress.com/papers/Unive ...math> grows to infinity, the sums have [[Limit inferior and limit superior|upper and lower limit points]] of −0.812140… and 0.187859…, separated by an [[int ...
    3 KB (492 words) - 05:31, 21 December 2024
  • ...set of diameter one. The [[diameter]] of a set by definition is the least upper bound of the distances between all pairs of points in the set. A shape cove ...sskrift Ser. B | pages = 96–99 | jstor = 24530328}}</ref> This reduced the upper bound on the area to <math>a \le 0.844137708436</math>. ...
    5 KB (695 words) - 23:07, 25 February 2023
  • ...mples of Kodaira class VII surfaces in 1974.<ref>M. Inoue, "On surfaces of class VII<sub>0</sub>," ''Inventiones math.'', 24 (1974), 269–310.</ref> ...2, 253&ndash;264 (1994)</ref> that any [[Surfaces of class VII|surface of class VII]] with <math display="inline">b_2=0</math> is a [[Hopf surface]] or an ...
    7 KB (1,132 words) - 06:06, 2 July 2021
  • ...ic barrier in Roth's theorem on arithmetic progressions |eprint=2007.03528|class=math.NT }}</ref> proved that any set such that <math>\sum_{n \in A} \frac{1 ...new upper bound for sets with no square differences |date=24 February 2021|class=math.NT |eprint=2011.13266 }}</ref> he improved the best-known bound for [[ ...
    5 KB (673 words) - 08:13, 28 September 2024
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)