Results 101 to 110 of about 58,072 (195)
Advancing mathematics by guiding human intuition with AI. [PDF]
Nature, 2021 Davies A +13 more
europepmc +1 more source
Topics in extremal graph theory and probabilistic combinatorics
, 2018 This thesis considers a variety of problems in Extremal Graph Theory and Probabilistic Combinatorics. Most of these problems are structural in nature, but some concern random reconstruction and parking problems. A matching in a bipartite graph G = (U, V, E) is a subset of the edges where no two edges meet, and each vertex from U is in an edge.
openaire +2 more sources
EXTREMAL DEPENDENCE IN EXCHANGE RATE MARKETS [PDF]
Exchange rate markets exhibit correlation in the short run, but the issue is whether such correlation lingers over long periods of time, and under extreme events (i.e., either large appreciations or depreciations).
Viviana Fernandez
core
What cannot be seen correctly in 2D visualizations of single-cell 'omics data? [PDF]
Cell Syst, 2023 Wang S, Sontag ED, Lauffenburger DA.
europepmc +1 more source
Topics in metric geometry, combinatorial geometry, extremal combinatorics and additive combinatorics
, 2018 In this thesis, we consider several combinatorial topics, belonging to the areas appearing in the thesis title. Given a non-empty complete metric space $(X,d)$, a family of $n$ continuous maps $f_1,f_2,\dots,f_n\colon X\to X$ is a \emph{contractive family} if there exists $\lambda<1$ such that for any $x,y\in X$ we have $d(f_i(x),f_i(y))\leq\lambda ...
openaire +1 more source
The n-queens completion problem. [PDF]
Res Math Sci, 2022 Glock S, Munhá Correia D, Sudakov B.
europepmc +1 more source
An extremal problem for univalent functions [PDF]
Let S be the class of functions f(z)=z+a2z2 ,… f(0)=0, f′(0)=1 which are regular and univalent in the unit disk |z| x the equation φ′( x)=0 does not have real roots. Since S is a compact class, there exists x . This problem was first proposed by Petru T.
Miodrag IOVANOV
core
The Seventh European Conference on Combinatorics, Graph Theory and Applications: EuroComb 2013
, 2013 In the tradition of EuroComb'01 (Barcelona), Eurocomb'03 (Prague), EuroComb'05 (Berlin), Eurocomb'07 (Seville), Eurocomb'09 (Bordeaux), and Eurocomb'11 (Budapest), this volume covers recent advances in combinatorics and graph theory including ...
J Nesetril, M Pellegrini
core
Combinatorial questions in optimal transport
, 2020 Several problems in extremal combinatorics arise from a new generalization of the optimal coupling theorem to multiple random variables: Given a collection of random variables, it is possible to couple all of them so that any two differ with ...
Angel, Omer
core
Note on extremal problems about connected subgraph sums. [PDF]
Graphs CombCambie S, Groenland C.
europepmc +1 more source