Search results

== Open problem == * [[List of unsolved problems in mathematics]] ...

...ent is a function <math>f: X \to N(X)</math> where <math>f(x)</math> is an open neighborhood. ...gy.<ref>{{Cite book|url=https://www.worldcat.org/oclc/162136062|title=Open problems in topology II|last=Elliott.|first=Pearl|date=2007-01-01|publisher=[[Elsevi ...

...ral powers of the moduli of the derivatives of [[conformal map]]s into the open unit disk. The conjecture was formulated by James E. Brennan in 1978.<ref n ...lane]]. Let <math>\varphi</math> be a conformal map of {{mvar|W}} onto the open unit disk. The '''Brennan conjecture''' states that ...

...all the jobs have finished processing). In the specific variant known as ''open-shop scheduling'', each job consists of a set of ''operations'' ''O''<sub>1 | title = Open shop scheduling to minimize finish time ...

...' or '''zero-sum theory''' is a branch of [[combinatorics]]. It deals with problems of the following kind: given a [[combinatorial]] structure whose elements a ...ion=us-east-1&originCreation=20230521193840 Zero-sum problems - A survey] (open-access journal article) ...

* [http://unsolvedproblems.org/ Unsolved Problems in Number Theory, Logic and Cryptography] ...urke/TOPP/ The Open Problems Project], discrete and computational geometry problems ...

...al \Omega</math> is a well-behaved [[boundary (topology)|boundary]] of the open set and <math>|\cdot|</math> is the [[Euclidean norm]]. ...Boue and P. Dupuis. Markov chain approximations for deterministic control problems with affine dynamics and quadratic cost in the control, SIAM J. on Numerica ...

...ine the [[star height]] of a [[regular language]], a problem that had been open since 1963 when Lawrence Eggan solved the related [[star height problem]], Earlier, in 1979, Hashiguchi had also solved another open problem on regular languages, of deciding whether, for a given language <ma ...

...data structure#Performance|local]] kinetic data structure for diameter is open. .... Efficient [[kinetic convex hull]] in dimensions higher than 2 is also an open problem.<ref>{{Citation ...

|title= Solved and Unsolved Problems in Number Theory ...ive empirical support, but it disagrees with the widely accepted (but also open) [[Lenstra–Pomerance–Wagstaff conjecture]]. ...

The existence of a local kinetic data structure for width is open. .... Efficient [[kinetic convex hull]] in dimensions higher than 2 is also an open problem.<ref>{{Citation ...

...egev |first=Oded |date=January 2004 |title=Quantum Computation and Lattice Problems |url=http://epubs.siam.org/doi/10.1137/S0097539703440678 |journal=SIAM Jour ...last3=Ip |first3=Lawrence |title =Quantum Algorithms for some Hidden Shift Problems|year =2002 |journal= [[SIAM Journal on Computing]] |volume=36 |issue=3 |pag ...

'''Kolchin's problems''' are a set of unsolved problems in [[differential algebra]], outlined by [[Ellis Kolchin]] at the [[Interna The '''Kolchin Catenary Conjecture''' is a fundamental open problem in [[differential algebra]] related to [[dimension theory]]. ...

{{Short description|Method of solving linear programming problems}} ...[[simplex algorithm]]. The Big M method extends the simplex algorithm to problems that contain "greater-than" constraints. It does so by associating the cons ...

...f a provably efficient network simplex algorithm was one of the major open problems in complexity theory, even though efficient-in-practice versions were avail The network simplex algorithm can be used to solve many practical problems including,<ref>{{Cite book|title = Linear Programming|last = Chvatal|first ...

...hematical Talent Search''' ('''USAMTS''') is a [[mathematics competition]] open to all [[United States]] students in or below [[high school]]. ...o academic year 2010–2011 the competition consisted of four rounds of five problems each, covering all non-[[calculus]] topics. Students were given approximat ...

...mporal Logic]] (MTL). This fragment is often preferred to MTL because some problems that are [[Undecidable problem|undecidable]] for MTL become [[Decidable pro === Problems that MITL avoids === ...

...ns|title=Dynamics of Second Order Rational Difference Equations: With Open Problems and Conjectures|first1=Mustafa R. S.|last1=Kulenovic|first2=G.|last2=Ladas| ...hell, Douglas W., "Reducing the dimensionality of linear quadratic control problems," ''[[Journal of Economic Dynamics and Control]]'' 31, 2007, 141&ndash;159. ...

...surface (Chern proposed this special case to the [[Shing-Tung Yau]]'s open problems' list in [[differential geometry]] in 1982): One should pay attention to the so-called first and second pinching problems as special parts for Chern. ...

...eonhole principle''') is a subclass of [[TFNP]]. It is the class of search problems that can be shown to be total by an application of the [[pigeonhole princip PPP is the set of all function computation problems that admit a [[polynomial-time reduction]] to the ''PIGEON'' problem, defin ...