language:
Find link is a tool written by Edward Betts.Longer titles found: Open Problems in Mathematics (view)
searching for Open problem 398 found (494 total)
alternate case: open problem
Emirp
(194 words)
[view diff]
exact match in snippet
view article
find links to article
{\displaystyle n} ). All non-palindromic permutable primes are emirps. It is an open problem whether there are infinitely many emirps. Weisstein, Eric W. "Emirp"Argument from ignorance (1,311 words) [view diff] exact match in snippet view article find links to article
the proposition can be called unproven, undecided, inconclusive, an open problem or a conjecture. The term was likely coined by philosopher John LockeIdentity-based cryptography (868 words) [view diff] exact match in snippet view article find links to article
with a concrete solution, and identity-based encryption remained an open problem for many years. The first practical implementations were finally devisedNC (complexity) (3,087 words) [view diff] no match in snippet view article
Unsolved problem in computer science N C = ? P {\displaystyle {\mathsf {NC}}{\overset {?}{=}}{\mathsf {P}}} More unsolved problems in computer scienceP (complexity) (1,940 words) [view diff] exact match in snippet view article
{P}}\subsetneq {\mathsf {NP}}} hypothesis) remains unproven. Another open problem is whether NP = co-NP; since P = co-P, a negative answer would implyLeo Moser (319 words) [view diff] exact match in snippet view article find links to article
this became known as Moser's worm problem and as of 2024 remains an open problem. Bell number Berlekamp switching game Salem–Spencer set Secretary problemBirch and Swinnerton-Dyer conjecture (3,144 words) [view diff] exact match in snippet view article find links to article
rational solutions to equations defining an elliptic curve. It is an open problem in the field of number theory and is widely recognized as one of theConjecture (3,039 words) [view diff] exact match in snippet view article find links to article
proving procedures" and is considered by many to be the most important open problem in the field. It is one of the seven Millennium Prize Problems selectedP versus NP problem (7,797 words) [view diff] exact match in snippet view article find links to article
verified in polynomial time. The problem has been called the most important open problem in computer science. Aside from being an important problem in computationalSimplicial sphere (515 words) [view diff] exact match in snippet view article find links to article
most simplicial spheres cannot be obtained in this way. One important open problem in the field was the g-conjecture, formulated by Peter McMullen, whichDiophantine set (1,479 words) [view diff] exact match in snippet view article find links to article
substituted for quantification over the integers is a notoriously hard open problem. The MRDP theorem (so named for the initials of the four principal contributorsMoving sofa problem (1,024 words) [view diff] exact match in snippet view article find links to article
to as the sofa constant. The exact value of the sofa constant is an open problem. The leading solution, by Joseph L. Gerver, has a value of approximatelyKähler–Einstein metric (4,230 words) [view diff] exact match in snippet view article find links to article
work. The third case, the positive or Fano case, remained a well-known open problem for many years. In this case, there is a non-trivial obstruction to existenceTheodorus of Cyrene (935 words) [view diff] exact match in snippet view article find links to article
system of the arithmetic of the even and the odd in and, but it is an open problem in a stronger natural axiom system for the arithmetic of the even andWarwick Tucker (222 words) [view diff] exact match in snippet view article find links to article
Carleson as advisor. In 2002, Tucker succeeded in solving an important open problem that had been posed by Stephen Smale (the fourteenth problem on Smale'sJulius Richard Büchi (182 words) [view diff] exact match in snippet view article find links to article
languages. The "n squares' problem", known also as Büchi's problem, is an open problem from number theory, closely related to Hilbert's tenth problem. FiniteSuslin tree (286 words) [view diff] exact match in snippet view article find links to article
Hypothesis implies the existence of an ℵ2-Suslin tree, is a longstanding open problem. Glossary of set theory Kurepa tree List of statements independent ofVan der Waerden's theorem (3,685 words) [view diff] exact match in snippet view article find links to article
be proved by considering examples). Therefore, W(2, 3) is 9. It is an open problem to determine the values of W(r, k) for most values of r and k. The proofErdős–Hajnal conjecture (1,328 words) [view diff] exact match in snippet view article find links to article
is named for Paul Erdős and András Hajnal, who first posed it as an open problem in a paper from 1977. More precisely, for an arbitrary undirected graphGraceful labeling (941 words) [view diff] exact match in snippet view article find links to article
β-labeling by Alexander Rosa in a 1967 paper on graph labelings. A major open problem in graph theory is the graceful tree conjecture or Ringel–Kotzig conjectureGábor J. Székely (1,422 words) [view diff] exact match in snippet view article find links to article
half-coin which involves negative probability, and the solution of an old open problem of lottery mathematics: in a 5-from-90 lotto the minimum number of ticketsPure type system (1,168 words) [view diff] exact match in snippet view article find links to article
just like the untyped lambda calculus[citation needed]. It is a major open problem in the field whether this is always the case, i.e. whether a (weakly)Identity-based encryption (1,950 words) [view diff] exact match in snippet view article find links to article
of identity-based signatures. Identity-based encryption remained an open problem for many years. The pairing-based Boneh–Franklin scheme and Cocks's encryptionNowhere-zero flow (1,600 words) [view diff] case mismatch in snippet view article find links to article
Comb. Theory Ser B, 30 (1981), 130–135. [1], Open Problem Garden. [2], Open Problem Garden. [3], Open Problem Garden. Zhang, Cun-Quan (1997). Integer FlowsRicci flow (8,360 words) [view diff] exact match in snippet view article find links to article
should be emphasized that the Poincaré conjecture has been a well-known open problem in the field of geometric topology since 1904. These results by HamiltonSzymański's algorithm (657 words) [view diff] exact match in snippet view article find links to article
favorable properties including linear wait, and which extension solved the open problem posted by Leslie Lamport whether there is an algorithm with a constantUrelement (995 words) [view diff] exact match in snippet view article find links to article
arithmetic; meanwhile, the consistency of NF relative to anything remains an open problem, pending verification of Holmes's proof of its consistency relative toBabai's problem (357 words) [view diff] no match in snippet view article find links to article
Unsolved problem in mathematics Which finite groups are BI-groups? More unsolved problems in mathematics Babai's problem is a problem in algebraic graphKinodynamic planning (305 words) [view diff] exact match in snippet view article find links to article
polynomial-time ε-approximation algorithm, they resolved a long-standing open problem in optimal control. Their first paper considered time-optimal controlCompressed suffix array (744 words) [view diff] exact match in snippet view article find links to article
original presentation of a compressed suffix array solved a long-standing open problem by showing that fast pattern matching was possible using only a linear-spaceFuglede's conjecture (807 words) [view diff] exact match in snippet view article find links to article
Fuglede's conjecture is an open problem in mathematics proposed by Bent Fuglede in 1974. It states that every domain of R d {\displaystyle \mathbb {R}Louis Nirenberg (5,007 words) [view diff] exact match in snippet view article find links to article
"Weyl problem" in differential geometry, which had been a well-known open problem since 1916. Following his doctorate, he became a professor at the CourantDecidability of first-order theories of the real numbers (503 words) [view diff] exact match in snippet view article find links to article
theory to another primitive operation, the exponential function. It is an open problem whether this theory is decidable, but if Schanuel's conjecture holdsLocation testing for Gaussian scale mixture distributions (643 words) [view diff] no match in snippet view article find links to article
In statistics, the topic of location testing for Gaussian scale mixture distributions arises in some particular types of situations where the more standardLife without Death (1,063 words) [view diff] exact match in snippet view article find links to article
question of whether such infinite growth patterns exist was posed as an open problem by Gravner, Griffeath, and Moore. The chaotic patterns common in thisDeletion channel (304 words) [view diff] exact match in snippet view article find links to article
{\displaystyle 1-p} ). Determining the capacity of the deletion channel is an open problem. The deletion channel should not be confused with the binary erasureMcMullen problem (784 words) [view diff] exact match in snippet view article find links to article
position? More unsolved problems in mathematics The McMullen problem is an open problem in discrete geometry named after Peter McMullen. In 1972, David G. LarmanZsolt Baranyai (172 words) [view diff] exact match in snippet view article find links to article
decompositions of complete hypergraphs, which solved a long-standing open problem. In addition to his mathematical pursuits, Baranyai was also a professionalGeometric complexity theory (472 words) [view diff] exact match in snippet view article find links to article
Milind Sohoni. The goal of the program is to answer the most famous open problem in computer science – whether P = NP – by showing that the complexityCostas array (1,937 words) [view diff] exact match in snippet view article find links to article
constructing Costas arrays. The general enumeration of Costas arrays is an open problem in computer science and finding an algorithm that can solve it in polynomialExcellent ring (1,468 words) [view diff] exact match in snippet view article find links to article
but the positive characteristic case is (as of 2024) still a major open problem. Essentially all Noetherian rings that occur naturally in algebraic geometryHypercube graph (1,775 words) [view diff] exact match in snippet view article find links to article
question whether every matching extends to a Hamiltonian cycle remains an open problem. The hypercube graph Q n {\displaystyle Q_{n}} (for n > 1 {\displaystyleKosaburo Hashiguchi (308 words) [view diff] exact match in snippet view article find links to article
2005 by Kirsten. Earlier, in 1979, Hashiguchi had also solved another open problem on regular languages, of deciding whether, for a given language A {\displaystyleQuasitrace (602 words) [view diff] exact match in snippet view article find links to article
C*-algebra. An additive quasitrace is called a trace. It is a major open problem if every quasitrace is a trace. A quasitrace on a C*-algebra A is a mapGrigorchuk group (2,731 words) [view diff] exact match in snippet view article find links to article
group has intermediate growth, thus providing an answer to an important open problem posed by John Milnor in 1968. The Grigorchuk group remains a key objectSupersolvable arrangement (162 words) [view diff] exact match in snippet view article find links to article
arrangement is a Koszul algebra; whether the converse is true is an open problem. Stanley, Richard P. (1972). "Supersolvable lattices". Algebra UniversalisNonlinear-feedback shift register (397 words) [view diff] exact match in snippet view article find links to article
construction of other large NLFSRs with guaranteed long periods remains an open problem. Using bruteforce methods, a list of maximum-period n-bit NLFSRs forPrincess and monster game (576 words) [view diff] exact match in snippet view article find links to article
princess full freedom of locomotion. This game remained a well-known open problem until it was solved by Shmuel Gal in the late 1970s. His optimal strategySpace complexity (1,004 words) [view diff] exact match in snippet view article find links to article
pseudorandomness and derandomization, where researchers consider the open problem of whether L = RL. The corresponding nondeterministic space complexityWoodall number (880 words) [view diff] exact match in snippet view article find links to article
particular, that almost all Woodall numbers are composite. It is an open problem whether there are infinitely many Woodall primes. As of October 2018[update]Cycle (graph theory) (1,857 words) [view diff] exact match in snippet view article
Proving that this is true (or finding a counterexample) remains an open problem. Several important classes of graphs can be defined by or characterizedInterest Flooding Attack (279 words) [view diff] exact match in snippet view article find links to article
malicious CPU or memory consumption. This attack was previously denoted an open problem in ICN, only heuristic countermeasures available.[vague] In 2016, AubreySpectrum of a theory (1,132 words) [view diff] exact match in snippet view article find links to article
false: this is called the Vaught conjecture and is the main remaining open problem (in 2005) in the theory of the spectrum. Morley's problem was a conjectureIsomorphism (2,733 words) [view diff] exact match in snippet view article find links to article
groups; the classification of isomorphism classes of finite groups is an open problem. Ring isomorphism between rings. Field isomorphisms are the same as ringList of unsolved problems in computer science (1,199 words) [view diff] exact match in snippet view article find links to article
uncertainty places it in a unique complexity class, making it a significant open problem in computer science. Is graph canonization polynomial-time equivalentCayley graph (4,692 words) [view diff] exact match in snippet view article find links to article
integers. While the complete classification of integral graphs remains an open problem, the Cayley graphs of certain groups are always integral. Using previousTheory of computation (2,168 words) [view diff] exact match in snippet view article find links to article
n ) {\displaystyle O(n)} steps to solve. Perhaps the most important open problem in all of computer science is the question of whether a certain broadNet (polyhedron) (1,435 words) [view diff] case mismatch in snippet view article
Conjecture", MathWorld Moskovich, D. (June 4, 2012), "Dürer's conjecture", Open Problem Garden Ghomi, Mohammad (2018-01-01), "Dürer's Unfolding Problem for ConvexNeusis construction (1,397 words) [view diff] exact match in snippet view article find links to article
powers of 5 greater than 5 itself by marked ruler and compass is an open problem, along with all primes greater than 11 of the form p = 2r3s5t + 1 whereStretch factor (771 words) [view diff] exact match in snippet view article find links to article
embeddings, are important in the theory of approximation algorithms. A major open problem in this area is the GNRS conjecture, which (if true) would characterizeRobert S. Doran (1,820 words) [view diff] exact match in snippet view article find links to article
his award-winning teaching, and for his solution to a long-standing open problem due to Irving Kaplansky on a symmetric *-algebra. Robert Stuart DoranMazur manifold (869 words) [view diff] exact match in snippet view article find links to article
This manifold is the unit ball D n {\displaystyle D^{n}} . It's an open problem as to whether or not D 5 {\displaystyle D^{5}} admits an exotic smoothBüchi's problem (1,060 words) [view diff] exact match in snippet view article find links to article
theory, Büchi's problem, also known as the n squares' problem, is an open problem named after the Swiss mathematician Julius Richard Büchi. It asks whetherSierpiński carpet (1,265 words) [view diff] exact match in snippet view article find links to article
satisfying the parabolic one. The existence of such an example was an open problem for many years. A variation of the Sierpiński carpet, called the WallisUnknot (589 words) [view diff] exact match in snippet view article find links to article
have the same Alexander and Conway polynomials as the unknot. It is an open problem whether any non-trivial knot has the same Jones polynomial as the unknotTheorem of absolute purity (256 words) [view diff] exact match in snippet view article find links to article
c_{r}(Z)} . The theorem was introduced in SGA 5 Exposé I, § 3.1.4. as an open problem. Later, Thomason proved it for large n and Gabber in general. purityRibbon knot (594 words) [view diff] exact match in snippet view article find links to article
local maxima. Every ribbon knot is known to be a slice knot. A famous open problem, posed by Ralph Fox and known as the slice-ribbon conjecture, asks ifResolution of singularities (5,480 words) [view diff] exact match in snippet view article find links to article
varieties of dimension at least 4 over fields of characteristic p, it is an open problem. Originally the problem of resolution of singularities was to find aGillies' conjecture (546 words) [view diff] exact match in snippet view article find links to article
conjectures due to I. J. Good and Daniel Shanks. The conjecture remains an open problem: several papers give empirical support, but it disagrees with the widelyStar unfolding (582 words) [view diff] exact match in snippet view article find links to article
unfolding restrict their cuts to the edges of the polyhedron. It is an open problem whether every polyhedron can be cut and unfolded to a simple polygon*-algebra (1,359 words) [view diff] case mismatch in snippet view article find links to article
"Semigroups, Antiautomorphisms, and Involutions: A Computer Solution to an Open Problem, I". Mathematics of Computation. 37 (156): 533–545. doi:10.2307/2007445Computer science (6,671 words) [view diff] exact match in snippet view article find links to article
famous P = NP? problem, one of the Millennium Prize Problems, is an open problem in the theory of computation. Information theory, closely related toSecond Hardy–Littlewood conjecture (324 words) [view diff] exact match in snippet view article find links to article
for x , y ≤ 200 {\displaystyle x,y\leq 200} Field Number theory Conjectured by G. H. Hardy John Edensor Littlewood Conjectured in 1923 Open problem yesMarshall Hall (mathematician) (635 words) [view diff] exact match in snippet view article
differences between perfect squares and perfect cubes, which remains an open problem as of 2015. Hall's work on continued fractions showed that the LagrangeSchnirelmann density (2,579 words) [view diff] exact match in snippet view article find links to article
{G}}^{2}=\{k^{2}\}_{k=1}^{\infty }} is an additive basis of degree 4. (About an open problem for additive bases, see Erdős–Turán conjecture on additive bases.) HistoricallyHamiltonian path (2,044 words) [view diff] exact match in snippet view article find links to article
the permanent was shown by Grigoriy Kogan. Barnette's conjecture, an open problem on Hamiltonicity of cubic bipartite polyhedral graphs Eulerian path,AI alignment (13,064 words) [view diff] exact match in snippet view article find links to article
have if they were more informed and enlightened. AI alignment is an open problem for modern AI systems and is a research field within AI. Aligning AIBounty (reward) (3,030 words) [view diff] exact match in snippet view article
mathematics to refer to a reward offered to any person willing to take on an open problem. Bounties are offered for solving a particular math problem – rangingJohn Horton Conway (3,411 words) [view diff] exact match in snippet view article find links to article
Davenport, began to undertake research in number theory. Having solved the open problem posed by Davenport on writing numbers as the sums of fifth powers, ConwayLocal uniformization (727 words) [view diff] exact match in snippet view article find links to article
characteristic for varieties of dimension at least 4 is (as of 2019) an open problem. Abhyankar, Shreeram (1956), "Local uniformization on algebraic surfacesDiffeomorphism (4,195 words) [view diff] exact match in snippet view article find links to article
> 3 {\displaystyle n>3} are poorly understood. For example, it is an open problem whether or not D i f f ( S 4 ) {\displaystyle \mathrm {Diff} (S^{4})}Liu Lu (165 words) [view diff] exact match in snippet view article find links to article
case n = 2) with 2-coloring does not imply WKL0 over RCA0, solving an open problem left by English logician David Seetapun in the 1990s (Liu (2012)). "MathNormal polytope (1,267 words) [view diff] no match in snippet view article find links to article
In mathematics, specifically in combinatorial commutative algebra, a convex lattice polytope P is called normal if it has the following property: givenAmir Ali Ahmadi (280 words) [view diff] exact match in snippet view article find links to article
is mostly in optimization. In his thesis, he answered a 20-year-old open problem posed by N. Z. Shor. For this contribution and other contributions toTime complexity (4,997 words) [view diff] exact match in snippet view article find links to article
but showing the existence of such a polynomial time algorithm is an open problem. Other computational problems with quasi-polynomial time solutions butMatthew Hastings (291 words) [view diff] exact match in snippet view article find links to article
conjecture for the classical capacity of quantum channels, a long standing open problem in quantum Shannon theory. He and Michael Freedman formulated the NLTSPolygon triangulation (1,386 words) [view diff] exact match in snippet view article find links to article
simple polygon can be triangulated faster than O(n log n) time was an open problem in computational geometry. Then, Tarjan & Van Wyk (1988) discovered anLow-dimensional topology (2,362 words) [view diff] exact match in snippet view article find links to article
topological manifolds not homeomorphic to a simplicial complex was an open problem. In 2013, Ciprian Manolescu posted a preprint on ArXiv showing that thereEpsilon-equilibrium (1,417 words) [view diff] exact match in snippet view article find links to article
approximate Nash equilibria, but the existence of a PTAS remains an open problem. For constant values of ε, polynomial-time algorithms for approximateGoldbach's conjecture (3,689 words) [view diff] exact match in snippet view article find links to article
1742 (Latin–German) Field Number theory Conjectured by Christian Goldbach Conjectured in 1742 Open problem Yes Consequences Goldbach's weak conjectureWeierstrass function (2,430 words) [view diff] exact match in snippet view article find links to article
{\textstyle D} of the graph of the classical Weierstrass function was an open problem until 2018, while it was generally believed that D = 2 + log b ( aM/G/1 queue (1,845 words) [view diff] exact match in snippet view article find links to article
theorem holds. Many metrics for the M/G/k queue with k servers remain an open problem, though some approximations and bounds are known. M/M/1 queue M/M/c queueHidden-line removal (1,403 words) [view diff] exact match in snippet view article find links to article
optimal. However, the log n factor was eliminated by Devai, who raised the open problem whether the same optimal O(n2) upper bound existed for hidden-surfaceRiemannian Penrose inequality (527 words) [view diff] exact match in snippet view article find links to article
an apparent horizon condition. Proving such an inequality remains an open problem in general relativity, called the Penrose conjecture. In episode 6 ofIrrational number (5,309 words) [view diff] exact match in snippet view article find links to article
question about the irrationality of Euler's constant γ is a long standing open problem in number theory. Other important numbers which are not known to be irrationalTetrahedron (7,879 words) [view diff] exact match in snippet view article find links to article
of the disphenoid tetrahedral honeycomb. The complete list remains an open problem. If one relaxes the requirement that the tetrahedra be all the same shapeNumerical digit (3,566 words) [view diff] exact match in snippet view article find links to article
The question of whether there are any Lychrel numbers in base 10 is an open problem in recreational mathematics; the smallest candidate is 196. CountingGlossary of functional analysis (3,264 words) [view diff] exact match in snippet view article find links to article
1. See topological tensor product. Note it is still somewhat of an open problem to define or work out a correct tensor product of topological vectorBridge (graph theory) (1,476 words) [view diff] exact match in snippet view article
that every connected component has a strong orientation. An important open problem involving bridges is the cycle double cover conjecture, due to SeymourBinary erasure channel (533 words) [view diff] exact match in snippet view article find links to article
e} ) then the channel is a deletion channel, and its capacity is an open problem. The BEC was introduced by Peter Elias of MIT in 1955 as a toy exampleBring's curve (1,018 words) [view diff] exact match in snippet view article find links to article
of the Bolza surface, although providing a rigorous proof is still an open problem. Following this pattern, one may reasonably conjecture that Bring's surfaceParamagnetism (4,375 words) [view diff] exact match in snippet view article find links to article
Pauli's theory, the lack of a strong Curie paramagnetism in metals was an open problem as the leading Drude model could not account for this contribution withoutKinetic smallest enclosing disk (434 words) [view diff] exact match in snippet view article find links to article
that has o ( n 3 + ϵ ) {\displaystyle o(n^{3+\epsilon })} events is an open problem. The smallest enclosing disk of a set of n moving points can be ε-approximatedNormal form (abstract rewriting) (1,284 words) [view diff] exact match in snippet view article
transformation function of the Collatz conjecture (1 ⇒ 2 ⇒ 4 ⇒ 1 ⇒ ..., it is an open problem if there are any other loops of the Collatz transformation). AnotherBioinformatics (8,523 words) [view diff] exact match in snippet view article find links to article
general solution to the prediction of the function of a protein remains an open problem. Most efforts have so far been directed towards heuristics that workLeonhard Euler (10,444 words) [view diff] exact match in snippet view article find links to article
originally posed by Pietro Mengoli in 1644, and by the 1730s was a famous open problem, popularized by Jacob Bernoulli and unsuccessfully attacked by many ofGo and mathematics (1,727 words) [view diff] exact match in snippet view article find links to article
This is the ko rule used in most Chinese and US rulesets. It is an open problem what the complexity class of Go is under superko rule. Though Go withNumber theory (9,977 words) [view diff] exact match in snippet view article find links to article
possible extensions of a given number field is a difficult and partially open problem. Abelian extensions—that is, extensions L of K such that the Galois groupTensor rank decomposition (6,321 words) [view diff] exact match in snippet view article find links to article
rank-1 tensors, where R is minimal. Computing this decomposition is an open problem.[clarification needed] Canonical polyadic decomposition (CPD) is a variantBCS theory (2,816 words) [view diff] exact match in snippet view article find links to article
dilute and dense regimes of attracting pairs of fermions is still an open problem, which now attracts a lot of attention within the field of ultracoldWafer (electronics) (4,082 words) [view diff] exact match in snippet view article
square aspect ratio, we arrive at the Gauss Circle Problem, an unsolved open problem in mathematics.) Note that formulas estimating the gross dies per waferGumbel distribution (3,175 words) [view diff] exact match in snippet view article find links to article
}[\mathrm {DGumbel} (0,1)]=1.077240905953631072609...} , but it remains an open problem to find a closed form for this constant (it is plausible there is none)Top quark (3,750 words) [view diff] exact match in snippet view article find links to article
coupling. This hierarchy in the fermion masses remains a profound and open problem in theoretical physics. Higgs–Yukawa couplings are not fixed constantsDevelopmental robotics (2,518 words) [view diff] exact match in snippet view article find links to article
at least in simulation, such as in morphogenetic robotics. Another open problem is the understanding of the relation between the key phenomena investigatedGilbreath's conjecture (1,057 words) [view diff] exact match in snippet view article find links to article
{\displaystyle k\leq n=3.4\times 10^{11}} in 1993, but the conjecture remains an open problem. Instead of evaluating n rows, Odlyzko evaluated 635 rows and establishedMathematical logic (8,373 words) [view diff] exact match in snippet view article find links to article
but was unable to produce a proof for this result, leaving it as an open problem in 1895. In the early decades of the 20th century, the main areas ofPPP (complexity) (1,000 words) [view diff] exact match in snippet view article
\pi (x)=y} . PPP contains PPAD as a subclass (strict containment is an open problem). This is because End-of-the-Line, which defines PPAD, admits a straightforwardHidden shift problem (412 words) [view diff] exact match in snippet view article find links to article
to the hidden subgroup problem for the dihedral group. It is a major open problem to understand how well quantum algorithms can perform for this task,Computational Diffie–Hellman assumption (796 words) [view diff] exact match in snippet view article find links to article
But there is no proof that it is, in fact, the only method. It is an open problem to determine whether the discrete log assumption is equivalent to theStephen Schanuel (165 words) [view diff] exact match in snippet view article find links to article
the field of transcendental number theory, which remains an important open problem to this day. Schanuel was a professor emeritus of mathematics at UniversityPerfect number (5,171 words) [view diff] exact match in snippet view article find links to article
I. Washington: Carnegie Institution of Washington. p. 6. "The oldest open problem in mathematics" (PDF). Harvard.edu. Retrieved 16 June 2023. OddperfectCalabi–Yau manifold (3,303 words) [view diff] exact match in snippet view article find links to article
dimensions, classification of the possible Calabi–Yau manifolds is an open problem, although Yau suspects that there is a finite number of families (albeitAdvisory circular (989 words) [view diff] case mismatch in snippet view article find links to article
ED-12( ) and RTCA DO-178( ) AC 00-71 Best Practices for Management of Open Problem Reports (OPRs) AC 00-72 Best Practices for Airborne Electronic HardwareHilbert's eighth problem (782 words) [view diff] exact match in snippet view article find links to article
Riemann hypothesis and much stronger results following from it are still open problem. Bombieri (2006). Hecke (1983). Bombieri, Enrico (2006), "The RiemannString theory (15,298 words) [view diff] exact match in snippet view article find links to article
that is unexpected and powerful. Polchinski notes that an important open problem in quantum gravity is to develop holographic descriptions of gravityHistory of classical mechanics (2,844 words) [view diff] exact match in snippet view article find links to article
relativity and quantum field theory into a quantum gravity theory is still an open problem in physics. Emmy Noether proved the Noether's theorem in 1918 relatingObjective-collapse theory (3,221 words) [view diff] exact match in snippet view article find links to article
possible solutions to the structured tails problem, but it remains an open problem. Interpretation of quantum mechanics Many-worlds interpretation PhilosophyKinetic triangulation (584 words) [view diff] exact match in snippet view article find links to article
near-quadratic bound on the number of discrete changes is an important open problem. The Delaunay triangulation seems like a natural candidate, but a tightChurch of Panagia Atheniotissa (826 words) [view diff] exact match in snippet view article find links to article
conclusions. When and by whom the vandalism was done nevertheless remains an open problem. Greece portal Christianity portal Conversion of non-Islamic places ofHyperplane separation theorem (2,689 words) [view diff] exact match in snippet view article find links to article
geometry Topological vector spaces Collision detection Conjectured by Hermann Minkowski Open problem No Generalizations Hahn–Banach separation theoremNapkin folding problem (1,075 words) [view diff] exact match in snippet view article find links to article
a general rigidly foldable solution exists based on sink folds is an open problem.[citation needed] In 1998, I. Yaschenko constructed a 3D folding withYang–Mills theory (4,223 words) [view diff] exact match in snippet view article find links to article
fields) have a finite mass-gap with regard to the vacuum state. Another open problem, connected with this conjecture, is a proof of the confinement propertyFriendly number (1,781 words) [view diff] exact match in snippet view article find links to article
instance, 24 is friendly, with its smallest friend 91,963,648. It is an open problem whether there are infinitely large clubs of mutually friendly numbersSimple polygon (3,206 words) [view diff] exact match in snippet view article find links to article
with a specified Hamiltonian cycle as its cycle of sides, remains an open problem. Carpenter's rule problem, on continuous motion of a simple polygon intoRobert F. Tichy (809 words) [view diff] exact match in snippet view article find links to article
the theory of equidistribution he solved (with Harald Niederreiter) an open problem of Donald Knuth's book The Art of Computer Programming, by showing thatBoson sampling (6,886 words) [view diff] exact match in snippet view article find links to article
permanents of positive-semidefinite matrices related to the corresponding open problem in computer science) by combining tools proper to quantum optics andMöbius strip (9,639 words) [view diff] exact match in snippet view article find links to article
between this bound and 3 {\displaystyle {\sqrt {3}}} , it has been an open problem whether smooth embeddings, without self-intersection, exist. In 2023Algebraic geometry (7,525 words) [view diff] exact match in snippet view article find links to article
y − 1 = 0 {\displaystyle xy-1=0} and x > 0 {\displaystyle x>0} . One open problem in real algebraic geometry is the following part of Hilbert's sixteenthExtremal graph theory (1,360 words) [view diff] exact match in snippet view article find links to article
inequality can be used to derive homomorphism inequalities. A major open problem relating homomorphism densities is Sidorenko's conjecture, which statesAmicable numbers (2,437 words) [view diff] exact match in snippet view article find links to article
produce only even amicable pairs, so they are of no interest for the open problem of finding amicable pairs coprime to 210 = 2·3·5·7, while over 1000 pairsTait's conjecture (654 words) [view diff] case mismatch in snippet view article find links to article
conjecture for 4-vertex-connected planar graphs Barnette's conjecture, the Open Problem Garden, retrieved 2009-10-12. Holton, D. A.; McKay, B. D. (1988), "TheAy (pharaoh) (3,062 words) [view diff] exact match in snippet view article
as Brier had theorized. The cause of Tutankhamun's demise is still an open problem in Egyptology, and Bob Brier still maintains the plausibility of Ay'sAction (philosophy) (4,910 words) [view diff] exact match in snippet view article
Some suggestions have been made on this issue but this is still an open problem since none of them have gathered significant support. The teleologicalGalois theory (4,221 words) [view diff] exact match in snippet view article find links to article
Galois theory, the Galois group of F/M is G. On the other hand, it is an open problem whether every finite group is the Galois group of a field extension ofRaymond Louis Wilder (1,347 words) [view diff] exact match in snippet view article find links to article
unimpressed by the young actuary, but Wilder went on to solve a difficult open problem that Moore had posed to his class. Moore suggested Wilder write up theScientific method (23,296 words) [view diff] exact match in snippet view article find links to article
follows. An extension of this is the assumption of a solution to an open problem. This weaker kind of deductive reasoning will get used in current researchJohn Toland (mathematician) (656 words) [view diff] exact match in snippet view article
existence of gravity waves of maximum height on deep water, a previously open problem in mathematical hydrodynamics which dated back to the 19th century. HeEnergy condition (2,326 words) [view diff] exact match in snippet view article find links to article
condition holds for everyday quantum fields. Extending these results is an open problem. The strong energy condition is obeyed by all normal/Newtonian matterModuli space (4,054 words) [view diff] exact match in snippet view article find links to article
construction of moduli spaces of Calabi-Yau varieties is an important open problem, and only special cases such as moduli spaces of K3 surfaces or AbelianBose–Einstein condensate (10,754 words) [view diff] exact match in snippet view article find links to article
99% of atoms to reach BEC. Achieving continuous BEC has been a major open problem of experimental BEC research, driven by the same motivations as continuousMads Tofte (612 words) [view diff] exact match in snippet view article find links to article
sound type system for ML-style polymorphic references, an important open problem at the time. Moreover, he formalized a variant of the module system ofQuantum complexity theory (3,640 words) [view diff] exact match in snippet view article find links to article
computers to be built. However, defining computation in these theories is an open problem due to the problem of time; that is, within these physical theories thereVon Neumann algebra (5,906 words) [view diff] exact match in snippet view article find links to article
the infinite (separable) factor of type I. For many years it was an open problem to find a type II factor whose fundamental group was not the group ofKnot theory (6,492 words) [view diff] exact match in snippet view article find links to article
important topic is the study of slice knots and ribbon knots. A notorious open problem, often attributed to Ralph Fox, asks whether every slice knot is alsoFáry's theorem (1,261 words) [view diff] exact match in snippet view article find links to article
"On a spatial analogue of Kuratowski's theorem on planar graphs — An open problem", in Horowiecki, M.; Kennedy, J. W.; Sysło, M. M. (eds.), Graph Theory:Schinzel's hypothesis H (1,743 words) [view diff] exact match in snippet view article find links to article
the existence of infinitely many twin primes, a basic and notorious open problem. As proved by Schinzel and Sierpiński it is equivalent to the following:Oka's lemma (346 words) [view diff] exact match in snippet view article find links to article
brief chronicle of the Levi (Hartog's inverse) problem, coherence and open problem". Notices of the International Congress of Chinese Mathematicians. 7Fermat number (4,727 words) [view diff] exact match in snippet view article find links to article
about Fermat numbers for large n. In fact, each of the following is an open problem: Is Fn composite for all n > 4? Are there infinitely many Fermat primesAxiom of choice (7,909 words) [view diff] exact match in snippet view article find links to article
equivalent, but whether the partition principle implies AC is the oldest open problem in set theory, and the equivalences of the other statements are similarlyLambda calculus (12,167 words) [view diff] exact match in snippet view article find links to article
polynomially proportional to the number of steps. This was a long-standing open problem, due to size explosion, the existence of lambda terms which grow exponentiallyQuantum cryptography (9,126 words) [view diff] exact match in snippet view article find links to article
formal unconditional location verification via quantum effects remains an open problem. The study of position-based quantum cryptography also has connectionsPsychoanalysis (21,796 words) [view diff] exact match in snippet view article find links to article
analyst himself projects such content onto his patient; then he has an own open problem and has to go to his own analyst if he is not yet able to help himselfElliott H. Lieb (3,206 words) [view diff] exact match in snippet view article find links to article
one, or possibly two extra electrons. To prove this rigorously is an open problem. A similar question can be asked concerning molecules. Lieb proved aCategorial grammar (3,689 words) [view diff] exact match in snippet view article find links to article
a Lambek grammar is context-free, is much more difficult. It was an open problem for nearly thirty years, from the early 1960s until about 1991 when itRepresentation theory (7,333 words) [view diff] exact match in snippet view article find links to article
as real reductive Lie groups (discussed below), remains an important open problem in representation theory. It has been solved for many particular groupsCollatz conjecture (7,117 words) [view diff] exact match in snippet view article find links to article
Open problem on 3x+1 and x/2 functionsNonlinear partial differential equation (1,085 words) [view diff] exact match in snippet view article find links to article
conjecture was the proof of existence for a Monge–Ampere equation. The open problem of existence (and smoothness) of solutions to the Navier–Stokes equationsHarmonic series (mathematics) (6,224 words) [view diff] exact match in snippet view article
O notation). Bounding the final error term more precisely remains an open problem, known as Dirichlet's divisor problem. Several common games or recreationsLinear logic (2,979 words) [view diff] exact match in snippet view article find links to article
EXPSPACE-hard, although decidability itself has had the status of a longstanding open problem. In 2015, a proof of decidability was published in the journal TheoreticalLOCC (3,095 words) [view diff] exact match in snippet view article find links to article
second law of entanglement manipulation has been identified as a major open problem in quantum information science. Quantum teleportation Unextendible productCatalan number (6,013 words) [view diff] exact match in snippet view article find links to article
= 2 , 3 {\displaystyle m=2,3} and 4 {\displaystyle 4} , and it is an open problem to find a general combinatorial interpretation. Sergey Fomin and NathanTriply periodic minimal surface (1,082 words) [view diff] exact match in snippet view article find links to article
differential geometry are often used. The classification of TPMS is an open problem. TPMS often come in families that can be continuously deformed into eachTwo-way finite automaton (1,619 words) [view diff] exact match in snippet view article find links to article
(n)} -state 2DFA? More unsolved problems in computer science It is an open problem whether every 2NFA can be converted to a 2DFA with only a polynomialInverse Gaussian distribution (3,166 words) [view diff] exact match in snippet view article find links to article
calculated, the derivation of the moment generating function remains an open problem. Despite the simple formula for the probability density function, numericalHyperfinite equivalence relation (1,671 words) [view diff] exact match in snippet view article find links to article
equivalence relation. While this is still an open problem, some partial results are known. Another open problem in the area is whether a countable increasingLamport signature (2,169 words) [view diff] exact match in snippet view article find links to article
taking into account the collection of multiple message digests is an open problem. Selection of larger element sizes and stronger hash functions, suchBraid group (4,920 words) [view diff] exact match in snippet view article find links to article
turned out to be negative for n ≥ 5. More generally, it was a major open problem whether braid groups were linear. In 1990, Ruth Lawrence described aDual matroid (972 words) [view diff] exact match in snippet view article find links to article
(matroids that can be partitioned into disjoint circuits). It is an open problem whether the family of algebraic matroids is self-dual. If V is a vectorVladimir Arnold (5,372 words) [view diff] exact match in snippet view article find links to article
topology. He also proposed the nearby Lagrangian conjecture, a still open problem in mathematics. According to Victor Vassiliev, Arnold "worked comparativelyRichard Schoen (3,305 words) [view diff] exact match in snippet view article find links to article
of the positive mass theorem in higher dimensions was left as a major open problem in Schoen and Yau's 1979 work. In 1988, they settled the problem in arbitraryRamond–Ramond field (2,285 words) [view diff] exact match in snippet view article find links to article
The incorporation of these corrections in the K-theory framework is an open problem. For more on this problem, click here. Kalb–Ramond field Ramond, P. (1971-05-15)Tate conjecture (1,191 words) [view diff] exact match in snippet view article find links to article
conjecture for divisors (algebraic cycles of codimension 1) is a major open problem. For example, let f : X → C be a morphism from a smooth projective surfaceLeftist tree (2,359 words) [view diff] exact match in snippet view article find links to article
bounded below by logφ n, but whether this is also the upper bound is an open problem. The s-value (or rank) of a node is the distance from that node to theSystem F (2,531 words) [view diff] exact match in snippet view article find links to article
type-checking straightforward. Joe Wells (1994) settled an "embarrassing open problem" by proving that type checking is undecidable for a Curry-style variantRamanujan graph (2,792 words) [view diff] exact match in snippet view article find links to article
original work of Marcus, Spielman and Srivastava to r-lifts. It is still an open problem whether there are infinitely many d {\displaystyle d} -regular (non-bipartite)Chomp (1,103 words) [view diff] exact match in snippet view article find links to article
indices of the chosen block. The case of ω × ω × ω Chomp is a notable open problem; a $100 reward has been offered for finding a winning first move. MoreProof complexity (3,760 words) [view diff] exact match in snippet view article find links to article
and it is optimal if it simulates all other proof systems. It is an open problem whether such proof systems exist: Problem (Optimality) Does there existVEST (1,531 words) [view diff] exact match in snippet view article find links to article
falling below their advertised security ratings for some keys remains an open problem and is computationally infeasible. They believe that these probabilitiesKinetic width (720 words) [view diff] exact match in snippet view article find links to article
dimensions higher than 2 is an open problem. Efficient kinetic convex hull in dimensions higher than 2 is also an open problem. Kinetic diameter Kinetic minimumSzemerédi's theorem (2,490 words) [view diff] exact match in snippet view article find links to article
"Rosetta stone" for connecting disparate fields of mathematics. It is an open problem to determine the exact growth rate of rk(N). The best known general boundsList edge-coloring (445 words) [view diff] exact match in snippet view article find links to article
the complete bipartite graph with equal partite sets. The most famous open problem about list edge-coloring is probably the list coloring conjecture. chTurán's brick factory problem (1,513 words) [view diff] exact match in snippet view article find links to article
Closing the gap between this lower bound and the upper bound remains an open problem. If edges are required to be drawn as straight line segments, ratherGraph canonization (1,115 words) [view diff] exact match in snippet view article find links to article
(deterministic) polynomial-time algorithms for graph isomorphism is still an open problem in computational complexity theory, in 1977 László Babai reported thatSocietal collapse (10,769 words) [view diff] exact match in snippet view article find links to article
that takes into account the complexity of human societies remains an open problem. Researchers currently have very little ability to identify internalSiegel disc (975 words) [view diff] exact match in snippet view article find links to article
strong irrationality condition (a Diophantine condition), thus solving an open problem since Fatou conjectured his theorem on the Classification of Fatou componentsFree electron model (3,426 words) [view diff] exact match in snippet view article find links to article
discrete values and it is associated to the electron magnetic moment. One open problem in solid-state physics before the arrival of quantum mechanics was toGabriele Nebe (213 words) [view diff] exact match in snippet view article find links to article
discovery of an extremal unimodular lattice in 72 dimensions settled a long open problem. 1995 – Friedrich Wilhelm Prize 2002 – Merckle Research Prize 2003 –Reconstruction conjecture (1,820 words) [view diff] exact match in snippet view article find links to article
trees (the Harary-Schwenk-Scott conjecture from 1972) was a longstanding open problem until 2017, when a non-reconstructible tree of maximum degree 3 was foundRunge–Kutta methods (7,400 words) [view diff] exact match in snippet view article find links to article
p + 2 {\displaystyle p+2} stages. In general, however, it remains an open problem what the precise minimum number of stages s {\displaystyle s} is forProjective plane (7,070 words) [view diff] exact match in snippet view article find links to article
projective plane of order N = 12 is still open. Another longstanding open problem is whether there exist finite projective planes of prime order whichWireless ad hoc network (6,519 words) [view diff] exact match in snippet view article find links to article
human mobility whilst remaining mathematically tractable remains an open problem due to the large range of factors that influence it. Some typical modelsParallel manipulator (1,670 words) [view diff] exact match in snippet view article find links to article
positions is difficult (for a general parallel manipulator, this is an open problem). This implies that the workspaces of the parallel manipulators are,Mass gap (1,114 words) [view diff] exact match in snippet view article find links to article
This is one of the Clay Institute Millennium problems and it remains an open problem. Such states for Yang–Mills theory should be physical states, named glueballsMladen Bestvina (1,761 words) [view diff] exact match in snippet view article find links to article
group Out(Fn) satisfies the Tits alternative, settling a long-standing open problem. In a 1997 paper Bestvina and Brady developed a version of discrete MorseList of unsolved problems in economics (2,063 words) [view diff] exact match in snippet view article find links to article
call options on an asset with stochastic volatility is considered an open problem in financial economics.[citation needed] Home bias in trade puzzle: TheUniform 5-polytope (2,258 words) [view diff] case mismatch in snippet view article find links to article
Bowers Uniform polytope ACW (May 24, 2012), "Convex uniform 5-polytopes", Open Problem Garden, archived from the original on October 5, 2016, retrieved 2016-10-04Reactive programming (3,451 words) [view diff] exact match in snippet view article find links to article
perform mutable operations. How to make this interaction smooth remains an open problem. In some cases, it is possible to have principled partial solutions.Emmy Noether (15,220 words) [view diff] exact match in snippet view article find links to article
the truth or falsehood of this bound for this particular case was an open problem, called "Noether's gap". It was finally solved independently by FleischmannPéter Frankl (602 words) [view diff] case mismatch in snippet view article find links to article
Retrieved 15 October 2015. Frankl's union-closed sets conjecture, the Open Problem Garden. http://blog.livedoor.jp/bbgmgt/archives/2935820.htmlChampernowne constant (2,108 words) [view diff] exact match in snippet view article find links to article
{\displaystyle C_{b}} is normal in base b {\displaystyle b} for any b. It is an open problem whether C k {\displaystyle C_{k}} is normal in bases b ≠ k {\displaystyleBarnette's conjecture (1,194 words) [view diff] case mismatch in snippet view article find links to article
1016/0012-365X(71)90027-6, MR 0291010 Weisstein, Eric W., "Barnette's Conjecture", MathWorld Barnette's Conjecture in the Open Problem Garden, Robert Samal, 2007.Tsirelson's bound (2,153 words) [view diff] exact match in snippet view article find links to article
that the one he had in mind didn't work, and issued the question as an open problem. Together with Miguel Navascués and Stefano Pironio, Antonio Acín hadWieferich prime (6,975 words) [view diff] exact match in snippet view article find links to article
Thus, a Mersenne prime cannot also be a Wieferich prime. A notable open problem is to determine whether or not all Mersenne numbers of prime index areKummer–Vandiver conjecture (981 words) [view diff] exact match in snippet view article find links to article
Kummer–Vandiver conjecture Field Algebraic number theory Conjectured by Ernst Kummer Conjectured in 1849 Open problem YesKinetic diameter (data) (672 words) [view diff] exact match in snippet view article
dimensions higher than 2 is an open problem. Efficient kinetic convex hull in dimensions higher than 2 is also an open problem. Kinetic width Kinetic minimumDavid Zuckerman (computer scientist) (405 words) [view diff] exact match in snippet view article
2015 Zuckerman and his student Eshan Chattopadhyay solved an important open problem in the area by giving the first explicit construction of two-source extractorsZvi Galil (2,104 words) [view diff] exact match in snippet view article find links to article
strings. In 1979, together with Ofer Gabber, Galil solved the previously open problem of constructing a family of expander graphs with an explicit expansionMoufang loop (1,773 words) [view diff] exact match in snippet view article find links to article
identities are somewhat more difficult (Kunen 1996). Phillips' problem is an open problem in the theory presented by J. D. Phillips at Loops '03 in Prague. ItList of incomplete proofs (4,389 words) [view diff] exact match in snippet view article find links to article
found gaps in many of them. The Jacobian conjecture is (as of 2016) an open problem, and more incomplete proofs are regularly announced. Hyman Bass, EdwinVirginia Ragsdale (843 words) [view diff] exact match in snippet view article find links to article
certain type. Her result is called the Ragsdale conjecture; it was an open problem for 90 years until counterexamples were derived by Oleg Viro (1979) andHale Trotter (588 words) [view diff] exact match in snippet view article find links to article
computations, number theory, and knot theory. In 1963, he solved an open problem in knot theory by proving that there are non-invertible knots. At theWirtinger presentation (488 words) [view diff] exact match in snippet view article find links to article
necessary and sufficient. Characterizing knot groups in dimension four is an open problem. For the trefoil knot, a Wirtinger presentation can be shown to be πIsing model (13,240 words) [view diff] exact match in snippet view article find links to article
quantum models, and quantum field theoretical arguments. Although it is an open problem to establish rigorously the renormalization group picture or the conformalStar height problem (1,353 words) [view diff] exact match in snippet view article find links to article
turned out to be much more difficult, and the question became a famous open problem in formal language theory for over two decades. For years, there wasList of things named after Jacques Hadamard (268 words) [view diff] exact match in snippet view article find links to article
manifolds of non-positive sectional curvature Cartan–Hadamard conjecture, an open problem in Riemannian geometry and geometric measure theory concerning the generalizationShai Halevi (781 words) [view diff] exact match in snippet view article find links to article
cryptographic obfuscation and many other applications), solving a long-standing open problem Homomorphic Encryption. Halevi is one of the leading researchers on homomorphicSet of uniqueness (971 words) [view diff] exact match in snippet view article find links to article
of uniqueness, but the sets in this example are not Borel. It is an open problem whether the union of any two Borel sets of uniqueness is a set of uniquenessMeta-circular evaluator (1,945 words) [view diff] exact match in snippet view article find links to article
implementation of the former in a strongly-normalizing language as an open problem. In combination with an existing language implementation, meta-circularGenerative adversarial network (13,865 words) [view diff] exact match in snippet view article find links to article
objective function. Many solutions have been proposed, but it is still an open problem. Even the state-of-the-art architecture, BigGAN (2019), could not avoidX + Y sorting (3,224 words) [view diff] exact match in snippet view article find links to article
{\displaystyle X+Y} sorting. Whether a faster algorithm exists is an open problem, posed by Elwyn Berlekamp prior to 1975. A variant of the problem sortsAverage-case complexity (3,058 words) [view diff] exact match in snippet view article find links to article
one-way functions. Although the existence of one-way functions is still an open problem, many candidate one-way functions are based on hard problems such asPseudorandom generator (1,864 words) [view diff] exact match in snippet view article find links to article
their existence implies P ≠ NP, which is widely believed but a famously open problem. The existence of cryptographically secure pseudorandom generators isAmenable group (3,232 words) [view diff] exact match in snippet view article find links to article
it is amenable. Amenable groups are unitarizable; the converse is an open problem. Countable discrete amenable groups obey the Ornstein isomorphism theoremCarminati–McLenaghan invariants (1,023 words) [view diff] exact match in snippet view article find links to article
exact number (and possible syzygies among the various invariants) is an open problem. Curvature invariant, for more about curvature invariants in (semi)-RiemannianNikolas Breuckmann (775 words) [view diff] exact match in snippet view article find links to article
Anurag Anshu and Chinmay Nirkhe) on proving the NLTS conjecture, a famous open problem in quantum information theory. Breuckmann was born in Duisburg and grewLottery mathematics (3,037 words) [view diff] no match in snippet view article find links to article
\choose B}{N-K \choose K-B} \over {N \choose K}} It is a hard (and often open) problem to calculate the minimum number of tickets one needs to purchase toPetersen family (908 words) [view diff] exact match in snippet view article find links to article
"On a spatial analogue of Kuratowski's Theorem on planar graphs – an open problem", in Horowiecki, M.; Kennedy, J. W.; Sysło, M. M. (eds.), Graph Theory:Jean A. Larson (642 words) [view diff] exact match in snippet view article find links to article
one exception, the spaces with exactly thirty points. This case was an open problem for many years, until it was resolved in 2010 by Betten and Betten. "JeanHirsch conjecture (1,370 words) [view diff] exact match in snippet view article find links to article
does not disprove the polynomial Hirsch conjecture, which remains an open problem. Ziegler (1994), p. 84. Dantzig (1963), pp. 160 and 168. E.g. see NaddefSnark (graph theory) (2,760 words) [view diff] case mismatch in snippet view article
S2CID 16237685 DeVos, Matthew (March 7, 2007), "4-flow conjecture", Open Problem Garden Wikimedia Commons has media related to Snarks (graph theory).List of misnamed theorems (1,989 words) [view diff] exact match in snippet view article find links to article
resolution, although providing a rigorous proof remained an outstanding open problem for much of the 19th century. Even though Cramer had cited MaclaurinSpin structure (4,373 words) [view diff] exact match in snippet view article find links to article
of spinors in supergravity and string theory is a particularly subtle open problem, which was recently addressed in references. It turns out that the standardDieter Kotschick (667 words) [view diff] exact match in snippet view article find links to article
the American Mathematical Society. In 2009, he solved a 55-year-old open problem posed in 1954 by Friedrich Hirzebruch, which asks "which linear combinationsLindemann–Weierstrass theorem (4,778 words) [view diff] exact match in snippet view article find links to article
function j was conjectured by Daniel Bertrand in 1997, and remains an open problem. Writing q = e2πiτ for the square of the nome and j(τ) = J(q), the conjectureKrohn–Rhodes theory (2,310 words) [view diff] exact match in snippet view article find links to article
over any fixed finite field has complexity n (Kambites, 2007). A major open problem in finite semigroup theory is the decidability of complexity: is there4-manifold (3,662 words) [view diff] exact match in snippet view article find links to article
much the same as the theory of 4 dimensional smooth manifolds. A major open problem in the theory of smooth 4-manifolds is to classify the simply connectedExponential time hypothesis (3,047 words) [view diff] exact match in snippet view article find links to article
maximum clique, it also implies that W[1] ≠ FPT. It is an important open problem in this area whether this implication can be reversed: does W[1] ≠ FPTCutting stock problem (2,422 words) [view diff] exact match in snippet view article find links to article
to have too many partially completed orders at any time. This was an open problem until 2007, when an efficient algorithm based on dynamic programmingJacob Palis (1,349 words) [view diff] case mismatch in snippet view article find links to article
"Jacob Palis Conjecture(Finitude of Attractors)(Dynamical Systems)". Open Problem Garden. "Palis' conjectures: a quest for a global qualitative view ofHerschel graph (1,667 words) [view diff] case mismatch in snippet view article find links to article
1112/jlms/s1-21.2.98 Šámal, Robert (11 June 2007), Barnette's conjecture, the Open Problem Garden, retrieved 24 Feb 2011 Ding, Guoli; Marshall, Emily (2018), "MinimalConcolic testing (1,998 words) [view diff] exact match in snippet view article find links to article
0x12345678) { ... } requires the theorem prover to invert SHA256, which is an open problem. pathcrawler-online.com is a restricted version of the current PathCrawlerNested triangles graph (741 words) [view diff] exact match in snippet view article find links to article
drawing area for completions of the nested triangle graph remains an open problem. Unsolved problem in mathematics What is the minimum bounding box areaMatrix mortality problem (289 words) [view diff] exact match in snippet view article find links to article
when n = 9, and for 2 matrices when n = 15. In the case n = 2, it is an open problem whether matrix mortality is decidable, but several special cases haveIntersection non-emptiness problem (490 words) [view diff] exact match in snippet view article find links to article
many additional hardness results have been shown. Yet, it is still an open problem to determine whether any faster algorithms exist. Kozen, D. (1977). LowerPainlevé transcendents (3,520 words) [view diff] exact match in snippet view article find links to article
was added to Painlevé's list by Gambier (1910). It was a controversial open problem for many years to show that these 6 equations really were irreducibleMichael Shub (878 words) [view diff] exact match in snippet view article find links to article
University of New York. In 1974, he proposed the Entropy Conjecture, an open problem in dynamical systems, which was proved by Yosef Yomdin for C ∞ {\displaystyleGyőző Zemplén (490 words) [view diff] exact match in snippet view article find links to article
entropy considerations (rather than only the energy theorem), he solved an open problem in the theory of shock waves in an essay "Sur l'impossibilité des ondesPebble automaton (690 words) [view diff] exact match in snippet view article find links to article
{\displaystyle TWA\subsetneq DPA} or these classes are incomparable, which is an open problem P A ⊊ R E G {\displaystyle PA\subsetneq REG} , i.e. tree-walking automataSecond neighborhood problem (1,020 words) [view diff] exact match in snippet view article find links to article
Dean, Nathaniel; Latka, Brenda J. (1995), "Squaring the tournament—an open problem", Proceedings of the Twenty-Sixth Southeastern International ConferenceTreewidth (4,575 words) [view diff] exact match in snippet view article find links to article
Algorithms, Springer, p. 969, ISBN 9780387307701, Another long-standing open problem is whether there is a polynomial-time algorithm to compute the treewidthHartmanis–Stearns conjecture (479 words) [view diff] exact match in snippet view article find links to article
computer science and mathematics, the Hartmanis–Stearns conjecture is an open problem named after Juris Hartmanis and Richard E. Stearns, who posed it in aAndrew H. Wallace (700 words) [view diff] exact match in snippet view article find links to article
" Here, he essentially settled in dimensions 5 and higher, the basic open problem regarding these geometric objects, though he did not push his resultsFrom Here to Infinity (book) (367 words) [view diff] exact match in snippet view article
example, when the 1st edition came out, Fermat's Last Theorem was still an open problem. By the 3rd edition, it has been solved by Andrew Wiles. Other revisedIsaak Moiseevich Milin (1,098 words) [view diff] exact match in snippet view article find links to article
conjecture on logarithmic coefficients published in 1983 is still an open problem. I.M. Milin devoted many years of his scientific life for active researchLattice problem (3,660 words) [view diff] exact match in snippet view article find links to article
the Voronoi cell of the lattice, and discrete Gaussian sampling. An open problem is whether algorithms for solving exact SVP exist running in single exponentialParsing expression grammar (6,497 words) [view diff] exact match in snippet view article find links to article
L(G_{1})\cup L(G_{2})} can be constructed S → start(G1) | start(G2) It is an open problem to give a concrete example of a context-free language which cannot beBaker's theorem (3,418 words) [view diff] exact match in snippet view article find links to article
p-adic setting, and using the p-adic logarithm function, remains an open problem. It is known that proving algebraic independence of linearly independentSelberg class (2,681 words) [view diff] exact match in snippet view article find links to article
functions; however, the uniqueness of such a factorization is still open problem. The prototypical example of an element in S is the Riemann zeta functionPerverse sheaf (2,265 words) [view diff] exact match in snippet view article find links to article
package by this Perverse sheaf for higher codimension strata is still an open problem. Markus Banagl (M. Banagl, 2010; M. Banagl, et al., 2014) addressed theFrançois Jaeger (659 words) [view diff] case mismatch in snippet view article find links to article
Open Problem Garden. The 4-flow conjecture, Open Problem Garden. The 5-flow conjecture, Open Problem Garden. Conjectures of François Jaeger, Open ProblemWitsenhausen's counterexample (1,325 words) [view diff] exact match in snippet view article find links to article
counterexample. The optimal solution of the counterexample is still an open problem. Witsenhausen, Hans. "A counterexample in stochastic optimum controlKinetic minimum box (407 words) [view diff] exact match in snippet view article find links to article
}).} The existence of a local data structure for this problem is an open problem. Agarwal, Pankaj; Guibas, Leonidas J.; Hershberger, John; Eric VeachState complexity (3,375 words) [view diff] exact match in snippet view article find links to article
(n)} -state 2DFA? More unsolved problems in computer science It is an open problem whether all 2NFAs can be converted to 2DFAs with polynomially many statesRota's basis conjecture (983 words) [view diff] case mismatch in snippet view article find links to article
Mathematical Society, 17 (4): 739–754, arXiv:0910.4987, Bibcode:2009arXiv0910.4987B, doi:10.4171/JEMS/516. Rota's basis conjecture, Open Problem Garden.Kinetic minimum box (407 words) [view diff] exact match in snippet view article find links to article
}).} The existence of a local data structure for this problem is an open problem. Agarwal, Pankaj; Guibas, Leonidas J.; Hershberger, John; Eric VeachChow group (4,204 words) [view diff] exact match in snippet view article find links to article
generated for any variety X of dimension n over a number field. It is an open problem whether all Chow groups are finitely generated for every variety overConway's 99-graph problem (709 words) [view diff] exact match in snippet view article find links to article
suggested in 1969 by Norman L. Biggs, and its existence noted as an open problem by others before Conway. Conway himself had worked on the problem asNidhal Guessoum (857 words) [view diff] exact match in snippet view article find links to article
problem of positron-electron annihilation in the milky-way galaxy, a still-open problem in high-energy astrophysics. His more recent work concerns gamma-raySymbolic communication (2,820 words) [view diff] exact match in snippet view article find links to article
something else. The origin of symbolic communication remains a controversial open problem, obscured by the lack of a fossil record. However, it has been speculatedKinetic minimum spanning tree (331 words) [view diff] exact match in snippet view article find links to article
O(n^{2})} events, developing a more efficient data structure remains an open problem. Agarwal et al. developed a data structure that maintains the MST forRyser's conjecture (876 words) [view diff] case mismatch in snippet view article find links to article
(2014). "Introduction to Ryser's Conjecture" (PDF). "Ryser's conjecture | Open Problem Garden". www.openproblemgarden.org. Retrieved 2020-07-14. Tuza (1983)Chain fountain (1,000 words) [view diff] exact match in snippet view article find links to article
phenomenon with the rising chain was already described in 2011 as an open problem for the 2012 International Young Physicists' Tournament (IYPT) and subsequentlyEndre Boros (536 words) [view diff] exact match in snippet view article find links to article
Khachiyan et al. (2008) resolved the complexity of the longstanding open problem of generating all vertices of polyhedra. Boros et al. (2008) uses a networkGeneralized blockmodeling (749 words) [view diff] case mismatch in snippet view article find links to article
Sociological Association. Generative model Doreian, Patrick (2006). "Some Open Problem Sets for Generalized Blockmodeling". In Batagelj, Vladimir (ed.). DataMacdonald polynomials (3,163 words) [view diff] exact match in snippet view article find links to article
Mark Haiman (2001), by proving the n! conjecture. It is still a central open problem in algebraic combinatorics to find a combinatorial formula for the qt-KostkaFunction of several complex variables (17,710 words) [view diff] exact match in snippet view article find links to article
brief chronicle of the Levi (Hartog's inverse) problem, coherence and open problem". Notices of the International Congress of Chinese Mathematicians. 7OntoClean (1,824 words) [view diff] exact match in snippet view article find links to article
see [Fine and Smith, 1983] and especially [Simons, 1987]. It is an open problem to adapt them into the OntoClean framework. Being dependent is indicatedHistory of electromagnetic theory (20,864 words) [view diff] exact match in snippet view article find links to article
physicist Paul A.M. Dirac in 1931. The detection of magnetic monopoles is an open problem in experimental physics. In some theoretical models, magnetic monopolesArrow (computer science) (1,556 words) [view diff] exact match in snippet view article
equivalence of arrows grouped in different ways. These limitations remain an open problem, and extensions such as Generalized Arrows and N-ary FRP explore theseApex graph (2,820 words) [view diff] case mismatch in snippet view article find links to article
Kawarabayashi (2009). Lewis & Yannakakis (1980). "Jorgensen's Conjecture", Open Problem Garden, retrieved 2016-11-13. Kawarabayashi et al. (2012). Eppstein (2000);Canadian traveller problem (1,910 words) [view diff] exact match in snippet view article find links to article
the graph (i-SSPPR) is a PSPACE-easy but ♯P-hard problem. It was an open problem to bridge this gap, but since then both the directed and undirected versionsTrifocal tensor (1,227 words) [view diff] exact match in snippet view article find links to article
using calibrated trifocal tensors have been studied, but remains an open problem for uncalibrated trifocal tensors. The classical case is 6 point correspondencesGyárfás–Sumner conjecture (481 words) [view diff] case mismatch in snippet view article find links to article
Journal of Graph Theory, 18 (2): 119–129, doi:10.1002/jgt.3190180203, MR 1258244 Graphs with a forbidden induced tree are chi-bounded, Open Problem GardenList of conjectures (1,461 words) [view diff] case mismatch in snippet view article find links to article
Unsolved Problems in Number Theory. Problem Books in Mathematics. Springer New York. ISBN 978-0-387-26677-0. Retrieved 2024-07-20. Open Problem GardenTsirelson space (1,654 words) [view diff] exact match in snippet view article find links to article
Tzafriri (1977), p. 95, say that this question was "a long standing open problem going back to Banach's book" (Banach (1932)), but the question does notHajós construction (1,470 words) [view diff] exact match in snippet view article find links to article
& Toft (1994), 11.6 Length of Hajós proofs, pp. 184–185, state as an open problem the question of determining the smallest number of steps needed to constructHans Georg Feichtinger (1,284 words) [view diff] exact match in snippet view article find links to article
first used by Peter G. Casazza. This question was not only an important open problem in frame theory but was found to be equivalent to the famous and long-openSupersymmetric theory of stochastic dynamics (5,974 words) [view diff] exact match in snippet view article find links to article
noise. A more rigorous theoretical explanation of 1/f noise remains an open problem. Since the late 80's, the concept of the Edge of chaos has emerged --Burau representation (1,525 words) [view diff] exact match in snippet view article find links to article
time. The faithfulness of the Burau representation when n = 4 is an open problem. The Burau representation appears as a summand of the Jones representationFinite sphere packing (2,655 words) [view diff] exact match in snippet view article find links to article
is always either a sausage or a cluster, and never a pizza. It is an open problem whether this holds true for all dimensions. This result only concernsRepresentation theory of the Lorentz group (19,763 words) [view diff] exact match in snippet view article find links to article
superstring theories too in attempts to create realistic models. One open problem is the completion of the Bargmann–Wigner programme for the isometry groupGiorgio Kaniadakis (743 words) [view diff] exact match in snippet view article find links to article
traced back to the first principles of Special Relativity. It answers the open problem on how the temperature of a body is transformed in a moving inertialLonely runner conjecture (3,289 words) [view diff] case mismatch in snippet view article find links to article
irrationalzehlen". Monatshefte für Mathematik. 71 (3): 263–269. doi:10.1007/BF01298332. S2CID 122754182. Article in the Open Problem Garden no. 4, 551–562.Michael Handel (531 words) [view diff] exact match in snippet view article find links to article
group Out(Fn) satisfies the Tits alternative, settling a long-standing open problem. In 1984, Handel won a Sloan Research Fellowship. In 2014, he becameNewman's conjecture (774 words) [view diff] exact match in snippet view article find links to article
number theory Conjectured by Morris Newman Conjectured in 25 March 1960 Open problem Yes Known cases Prime powers except powers of 2 or powers of 3, plusGreek investments in North Macedonia (641 words) [view diff] exact match in snippet view article find links to article
However, there has been no progress on the name issue which remains an open problem. Renewed efforts are needed, with a constructive approach, to find aNathaniel Dean (mathematician) (1,046 words) [view diff] exact match in snippet view article
Dean, Nathaniel; Latka, Brenda J. (1995), "Squaring the tournament—an open problem", Proceedings of the Twenty-Sixth Southeastern International ConferenceComputing the permanent (4,589 words) [view diff] exact match in snippet view article find links to article
(1978) Little (1974), Vazirani (1988) Pólya (1913), Reich (1971) See open problem (4) at Shtetl Optimized: Introducing some British people to P vs. NPΧ-bounded (1,523 words) [view diff] case mismatch in snippet view article find links to article
{\displaystyle \chi } -boundedness", Combinatorica, arXiv:2201.08814, doi:10.1007/s00493-023-00054-3, S2CID 246476859 Chi-bounded, Open Problem GardenWoodall's conjecture (621 words) [view diff] case mismatch in snippet view article find links to article
Feofiloff, Paulo (November 30, 2005), Woodall’s conjecture on Packing Dijoins: a survey (PDF) "Woodall's conjecture", Open Problem Garden, April 5, 2007Four exponentials conjecture (2,300 words) [view diff] exact match in snippet view article find links to article
already known, by consequence of the Gelfond–Schneider theorem). An open problem in number theory settled by the conjecture is the question of whetherBelief revision (7,935 words) [view diff] exact match in snippet view article find links to article
K} that are consistent with P {\displaystyle P} ; Williams solved an open problem by developing a new representation for finite bases that allowed forAlbertson conjecture (1,160 words) [view diff] exact match in snippet view article find links to article
There is also a connection to the Hadwiger conjecture, an important open problem in combinatorics concerning the relationship between chromatic numberJohn R. Stallings (3,600 words) [view diff] exact match in snippet view article find links to article
Stalling's theorem yielded a positive solution to the long-standing open problem about characterizing finitely generated groups of cohomological dimensionLinkless embedding (3,484 words) [view diff] exact match in snippet view article find links to article
"On a spatial analogue of Kuratowski's Theorem on planar graphs – an open problem", in Horowiecki, M.; Kennedy, J. W.; Sysło, M. M. (eds.), Graph Theory:Minimum-weight triangulation (3,289 words) [view diff] exact match in snippet view article find links to article
triangulation decision problem is NP-complete, since this depends on the known open problem whether the sum of radicals may be computed in polynomial time. HoweverReconfiguration (1,182 words) [view diff] exact match in snippet view article find links to article
between two trees with a given number of nodes is known, but it remains an open problem whether the rotation distance between two arbitrary trees can be foundSquare-root sum problem (1,436 words) [view diff] exact match in snippet view article find links to article
accuracy digits required to solve SRS. Computing r(n,k) is open problem 33 in the open problem project. In particular, it is interesting whether r(n,k)Tracy Yerkes Thomas (861 words) [view diff] exact match in snippet view article find links to article
effect of this friction in some cases. He went on to solve a famous open problem concerning the motion of pairs of bodies. There followed a long seriesShannon capacity of a graph (1,840 words) [view diff] case mismatch in snippet view article find links to article
P=NP. tchow (February 19, 2009), "Shannon capacity of the seven-cycle", Open Problem Garden. Alon, Noga; Lubetzky, Eyal (2006), "The Shannon capacity of a100 prisoners problem (3,577 words) [view diff] exact match in snippet view article find links to article
nowhere and thus the cycle-following strategy cannot be applied. It is an open problem whether in this case the winning probability tends to zero with growingCertification Authorities Software Team (711 words) [view diff] case mismatch in snippet view article find links to article
Rationale for Accepting Masking MC/DC in Certification Projects 2001 CAST-7 Open Problem Report (OPR) Management for Certification 2001 CAST-8 Use of the C++Rational homotopy theory (4,052 words) [view diff] exact match in snippet view article find links to article
rationalization). Computing the homotopy groups of spheres is a central open problem in homotopy theory. However, the rational homotopy groups of spheresCap set (2,244 words) [view diff] exact match in snippet view article find links to article
Terence Tao. In his blog post, Tao refers to it as "perhaps, my favorite open problem" and gives a simplified proof of the exponential bound on cap sets, namelyRostislav Grigorchuk (1,995 words) [view diff] exact match in snippet view article find links to article
intermediate growth in a 1984 article. This result answered a long-standing open problem posed by John Milnor in 1968 about the existence of finitely generatedBonifacio Ondó Edú (2,322 words) [view diff] exact match in snippet view article find links to article
free personnel, and "gifts" from the Casas Fuertes. Corruption was an open problem in the administration as well. Rafael Nsue Nchama was dismissed in 1966TFNP (2,698 words) [view diff] exact match in snippet view article find links to article
coNP, which is generally conjectured to be false, but is still a major open problem in complexity theory. This lack of connections with NP is a major motivationKobayashi metric (2,246 words) [view diff] exact match in snippet view article find links to article
dimension 1. The picture is less clear in higher dimensions. A central open problem is the Green–Griffiths–Lang conjecture: if X is a complex projectiveK-server problem (1,379 words) [view diff] case mismatch in snippet view article find links to article
doi:10.1145/2783434. MR 3424197. S2CID 15668961. "Another Annoying Open Problem". 19 November 2011. Lee, James R. (2017). "Fusible HSTs and the RandomizedGiovanni Alberti (mathematician) (475 words) [view diff] exact match in snippet view article
several applications, as for instance in the Ambrosio's proof of an open problem posed by Di Perna and Lions concerning the well-posedness of the continuityRigidity matroid (2,242 words) [view diff] exact match in snippet view article find links to article
bases of the rigidity matroid of the complete graph) is an important open problem. Graver, Jack E. (1991), "Rigidity matroids", SIAM Journal on DiscreteHamiltonian complexity (381 words) [view diff] exact match in snippet view article find links to article
quantum systems. Proving the quantum analog of the PCP theorem is an open problem. Hamiltonian simulation Density matrix renormalization group Matrix productIndistinguishability obfuscation (2,301 words) [view diff] exact match in snippet view article find links to article
generators in NC0 (even with sub-linear stretch) was a long-standing open problem until 2006.) It is possible that this construction could be broken withConfiguration linear program (2,461 words) [view diff] exact match in snippet view article find links to article
integrality gap is a constant Ω(1). Finding the exact integrality gap is an open problem. In the bin covering problem, there are n items with different sizesMetric dimension (graph theory) (2,520 words) [view diff] exact match in snippet view article
number or max leaf number all have bounded treewidth, however it is an open problem to determine the complexity of the metric dimension problem even on graphsBumblebee models (3,252 words) [view diff] exact match in snippet view article find links to article
resulting massive spin connection, free of ghosts and tachyons, remains an open problem. Standard-Model Extension Riemann–Cartan geometry Antimatter tests ofArrangement of lines (6,725 words) [view diff] exact match in snippet view article find links to article
bounds for the complexity of a k {\displaystyle k} -level remains a major open problem in discrete geometry. The best upper bound known is O ( n k 1 / 3 ) {\displaystyleAnatol Slissenko (1,869 words) [view diff] exact match in snippet view article find links to article
touching skew straight lines in 3-dimensional space that solves a known open problem. A model checking algorithm for a rather powerful logic with an operatorSrinivas Aluru (1,269 words) [view diff] exact match in snippet view article find links to article
and algorithms for approximate sequence matching. He also solved the open problem of computing string edit distance or biological sequence alignments inHopf conjecture (2,288 words) [view diff] exact match in snippet view article find links to article
geometry and topology attributed to Heinz Hopf. The Hopf conjecture is an open problem in global Riemannian geometry. It goes back to questions of Heinz HopfGiorgi Japaridze (2,628 words) [view diff] exact match in snippet view article find links to article
equivalent to 1-consistency. The former was an answer to the long-standing open problem regarding the metamathematical meaning of 1-conservativity. Within theFeedback arc set (6,116 words) [view diff] exact match in snippet view article find links to article
algorithm, or whether a non-constant ratio is necessary, remains an open problem. The maximum acyclic subgraph problem has an easy approximation algorithmApollonian network (4,752 words) [view diff] exact match in snippet view article find links to article
that, at every step, the edge lengths are rational numbers; it is an open problem whether every planar graph has a drawing with this property. It is possibleWord-representable graph (3,653 words) [view diff] exact match in snippet view article find links to article
not result in a word-representable graph, which solved a long-standing open problem. A graph is p-representable if it can be represented by a word avoidingUnfriendly partition (392 words) [view diff] exact match in snippet view article find links to article
remains open. DeVos, Matthew (October 22, 2007), "Unfriendly partitions", Open problem garden Shelah, Saharon; Milner, E. C. (1990), "Graphs with no unfriendlyFactorization of polynomials over finite fields (4,636 words) [view diff] exact match in snippet view article find links to article
deterministic algorithm with a polynomial worst-case complexity is still an open problem. Like distinct-degree factorization algorithm, Rabin's algorithm is basedUnrelated-machines scheduling (1,846 words) [view diff] exact match in snippet view article find links to article
unless P=NP. Closing the gap between the 2 and the 3/2 is a long-standing open problem. Verschae and Wiese presented a different 2-factor approximation algorithmQuasiconvexity (calculus of variations) (1,691 words) [view diff] exact match in snippet view article
case d = 2 {\displaystyle d=2} or m = 2 {\displaystyle m=2} is still an open problem, known as Morrey's conjecture. Under certain growth condition of theJakob Stoustrup (1,528 words) [view diff] exact match in snippet view article find links to article
tolerant control systems provides a positive answer to a previously open problem. By a constructive proof it is established that under mild conditionsFréchet algebra (3,460 words) [view diff] exact match in snippet view article find links to article
as Michael's Conjecture. This conjecture is perhaps the most famous open problem in the theory of topological algebras. An increasing family means thatRefinement monoid (1,360 words) [view diff] exact match in snippet view article find links to article
elements can be represented as V(R) for R von Neumann regular is an open problem. Dobbertin, Hans (1983), "Refinement monoids, Vaught monoids, and BooleanFleischner's theorem (1,516 words) [view diff] exact match in snippet view article find links to article
finite bound on toughness might imply Hamiltonicity remains an important open problem in graph theory. A simpler proof both of Fleischner's theorem, and ofOutline of natural language processing (7,763 words) [view diff] exact match in snippet view article find links to article
dictionary or from an online resource such as WordNet. Word-sense induction – open problem of natural-language processing, which concerns the automatic identificationVladimir Mazya (7,002 words) [view diff] exact match in snippet view article find links to article
343 of the English translation). The necessity of the condition was an open problem until 1993, when it was proved by Kilpeläinen & Malý (1994). (Maz'yaTopological graph (3,579 words) [view diff] exact match in snippet view article find links to article
path of size at least cn, where c > 0 is a constant, is a long-standing open problem. It is only known that every complete geometric graph on n vertices containsNarrow escape problem (3,050 words) [view diff] exact match in snippet view article find links to article
general domains, the asymptotic expansion of the escape time remains an open problem. So does the problem of computing the escape time near a cusp point inFree energy principle (6,375 words) [view diff] exact match in snippet view article find links to article
top-down vs. bottom-up controversy, which has been addressed as a major open problem of attention, a computational model has succeeded in illustrating theBarrier resilience (1,083 words) [view diff] exact match in snippet view article find links to article
subdivision. The complexity of barrier resilience for unit disk barriers is an open problem. It may be solved by a fixed-parameter tractable algorithm whose timeGalactic algorithm (2,737 words) [view diff] exact match in snippet view article find links to article
would settle the P versus NP problem, considered the most important open problem in computer science and one of the Millennium Prize Problems. An exampleEarth–Moon problem (1,846 words) [view diff] case mismatch in snippet view article find links to article
30..187A, doi:10.1070/SM1976v030n02ABEH002267, MR 0460162 Weisstein, Eric W., "Earth-Moon Problem", MathWorld "Earth-Moon Problem", Open Problem GardenPerles configuration (1,922 words) [view diff] exact match in snippet view article find links to article
conjectured that this is true for all numbers of points, but this remains an open problem. Ziegler (2008). Grünbaum (2003). Solymosi (2025). Grünbaum (2003), pPeriodic travelling wave (3,415 words) [view diff] exact match in snippet view article find links to article
wave family is selected. For most mathematical systems this remains an open problem. It is common that for some parameter values, the periodic travellingBasic feasible solution (2,020 words) [view diff] exact match in snippet view article find links to article
time algorithm for solving any linear program (the latter is a famous open problem). Megiddo's algorithms can be executed using a tableau, just like theMunther A. Dahleh (1,710 words) [view diff] exact match in snippet view article find links to article
In the late 1980s, Dahleh solved the L1 optimal control problem — an open problem at the time that addresses robustness in the presence of persistent disturbancesSparse distributed memory (7,736 words) [view diff] exact match in snippet view article find links to article
Seymour. "Perceptrons." (1969). "Time vs. memory for best matching - an open problem" p. 222–225 Uma Ramamurthy; Sidney K. D'Mello; Stan Franklin. "RealizingDEVS (13,730 words) [view diff] exact match in snippet view article find links to article
designed to support verification analysis of its networks which had been an open problem of DEVS formalism for 30 years. In addition, it was also designated toOcean Grazer (724 words) [view diff] exact match in snippet view article find links to article
difficult and expensive. The connection to the electricity grid is still an open problem, a suitable solution to deliver the generated electrical energy needsTimeline of manifolds (1,178 words) [view diff] exact match in snippet view article find links to article
existence of a common refinement of two triangulations. This was an open problem, for manifolds, to 1961. 1910 L. E. J. Brouwer Brouwer's theorem on invarianceKinetic convex hull (1,934 words) [view diff] exact match in snippet view article find links to article
maintaining the convex hull of moving points in dimensions higher than 2 is an open problem. Kinetic convex hull can be used to solve the following related problems:Pancake graph (1,957 words) [view diff] exact match in snippet view article find links to article
18/11n (approximately 1.07n and 1.64n,) but the exact value remains an open problem. In 1979, Bill Gates and Christos Papadimitriou gave an upper bound ofRachid Guerraoui (1,717 words) [view diff] exact match in snippet view article find links to article
atomic commitment and consensus, for which he helped close the then open problem of the weakest failure detector for consensus with any number of faultsWelfare maximization (2,835 words) [view diff] exact match in snippet view article find links to article
the algorithm can be made deterministic.: Sec.5 They mention as an open problem, whether there is a deterministic polytime (1-1/e)-approximation algorithmWassim Michael Haddad (4,330 words) [view diff] exact match in snippet view article find links to article
foundational work. This work was the first to satisfactorily address the then open problem on robust stability and performance problems for constant real parameterHannah Cairo (495 words) [view diff] exact match in snippet view article find links to article
described her as one of the youngest mathematicians to resolve a major open problem. Cairo, Hannah Mira (2025). "A Counterexample to the Mizohata–TakeuchiRank of an elliptic curve (2,799 words) [view diff] exact match in snippet view article find links to article
elliptic curves which led to their famous conjecture. It is in general an open problem whether the rank of all elliptic curves over a fixed field K is boundedAlexandru Cantacuzino (militant) (1,742 words) [view diff] exact match in snippet view article
Romanian Nation", lest the Legionaries "find another solution to the open problem". In his later memoirs, Horia Sima noted that these manifestos receivedGraph coloring game (4,118 words) [view diff] exact match in snippet view article find links to article
Bodlaender's paper, the computational complexity was left as "an interesting open problem". Only in 2020 it was proved that the game is PSPACE-Complete. AcyclicList of Starsky & Hutch episodes (30 words) [view diff] no match in snippet view article find links to article
Danner's history as a stamp collector to try to lure him out in the open. Problem is, one of Danner's men, Shockley (David Cass), knows who Hutch is,Plancherel theorem for spherical functions (11,769 words) [view diff] exact match in snippet view article find links to article
generalising the computation of Godement (1957) for SL(2,R), was left as an open problem by Flensted-Jensen (1978). An explicit product formula for b(λ) was knownJoshua Evan Greene (485 words) [view diff] exact match in snippet view article find links to article
New Geometric Perspective Cracks Old Problem About Rectangles "This open problem taught me what topology is". youtube.com. "Joshua Greene '02 to ReceiveRank-finiteness (544 words) [view diff] exact match in snippet view article find links to article
spherical fusion categories of a given rank. This is related to the other open problem of determining whether or not it is true that every fusion category admitsFirst Hardy–Littlewood conjecture (651 words) [view diff] exact match in snippet view article find links to article
predicts there are infinitely many of these. Field Number theory Conjectured by G. H. Hardy John Edensor Littlewood Conjectured in 1923 Open problem yesGraph flattenability (3,922 words) [view diff] exact match in snippet view article find links to article
-flattenable graphs, for dimension d > 3 {\displaystyle d>3} , is an open problem. For any dimension d {\displaystyle d} , K d + 2 {\displaystyle K_{d+2}}Ida Magli (634 words) [view diff] exact match in snippet view article find links to article
Some of her publications focused on these which include The woman, an open problem (1974), Matriarchy and the power of women (1978), The female of man (1982)Mobile membranes (7,128 words) [view diff] exact match in snippet view article find links to article
instead of twelve membranes. If this is an optimal construction remains an open problem. Theorem. E M 9 ( e n d o , e x o , f e n d o , f e x o ) = R E {\displaystyleLouxin Zhang (840 words) [view diff] exact match in snippet view article find links to article
studying phylogenetic networks. The technique yields a solution to an open problem regarding tree containment, the exact and asymptotic counting of theCraig S. Kaplan (1,031 words) [view diff] exact match in snippet view article find links to article
Kaplan was part of the team that solved the einstein problem, a major open problem in tiling theory and Euclidean geometry. The problem is to find an "aperiodicSimplex tree (1,367 words) [view diff] exact match in snippet view article find links to article
computing Betti numbers, using a simplex tree most efficiently remains an open problem, however, current algorithms for this task on sparse simplicial complexesCommon net (858 words) [view diff] exact match in snippet view article find links to article
nets refers to the number of common nets for the same set of polyhedra. Open problem 25.31 in Geometric Folding Algorithm by Rourke and Demaine reads: CanMean payoff game (1,350 words) [view diff] exact match in snippet view article find links to article
partition (and is also related to solving energy games) It is a major open problem in computer science whether there exists a polynomial time algorithmJames Clerk Maxwell Medal and Prize (1,278 words) [view diff] exact match in snippet view article find links to article
work on proving the no low-energy trivial state conjecture, a famous open problem in quantum information theory." 2024 Frank Schindler, "For numerous conceptualKotzig's conjecture (1,265 words) [view diff] exact match in snippet view article find links to article
known as friendship graphs). Kotzig's conjecture was first listed as an open problem by Bondy & Murty in 1976, attributed to Kotzig and dated to 1974. Kotzig'sCentral groupoid (1,378 words) [view diff] exact match in snippet view article find links to article
numbers, for general values of k {\displaystyle k} , was stated as an open problem by Alan J. Hoffman in 1967. As with any variety of algebras, the centralList-labeling problem (2,582 words) [view diff] exact match in snippet view article find links to article
( log n ) {\displaystyle \Omega (\log n)} . Indeed, it has been an open problem since 1981 to close the gap between the O ( log 2 n ) {\displaystyleQuantum Cheshire cat (2,159 words) [view diff] exact match in snippet view article find links to article
depends on the interpretation of quantum mechanics, which is still an open problem in physics. Some authors reach different conclusions for this effectAsymptotic geometry (2,465 words) [view diff] exact match in snippet view article find links to article
{\displaystyle M=\int _{S^{n-1}}\|x\|d\sigma (x)} . A long-standing open problem in convex geometry and asymptotic geometric analysis is the hyperplaneUtility assessment (2,872 words) [view diff] exact match in snippet view article find links to article
not fit the data. He leaves finding a better-fitting function as an open problem. A multi-attribute utility (MAU) function maps a bundle with two or moreMulti-issue voting (6,450 words) [view diff] exact match in snippet view article find links to article
existence of an EJR rule that satisfies House monotonicity, which is another open problem). Stronger variants of these properties, where groups of voters may have