Results 31 to 40 of about 976,099 (318)
Modalities in homotopy type theory
, 2020 Univalent homotopy type theory (HoTT) may be seen as a language for the category of $\infty$-groupoids. It is being developed as a new foundation for mathematics and as an internal language for (elementary) higher toposes.
Rijke, Egbert +2 more
core +1 more source
An Efficient Algorithm to Test Forcibly-connectedness of Graphical Degree Sequences
Theory and Applications of Graphs, 2018 We present an algorithm to test whether a given graphical degree sequence is forcibly connected or not and prove its correctness. We also outline the extensions of the algorithm to test whether a given graphical degree sequence is forcibly $k$-connected ...
Kai Wang
doaj +1 more source
Local n-connectivity of decomposition spaces
Topology and its Applications, 1984 The authors study conditions which guarantee a decomposition space is homotopy locally connected.
Dydak, J., Segal, J.
openaire +1 more source
A Komatu-Loewner Equation for Multiple Slits
, 2014 We give a generalization of the Komatu-Loewner equation to multiple slits. Therefore, we consider an $n$-connected circular slit disk $\Omega$ as our initial domain minus $m\in \mathbb{N}$ disjoint, simple and continuous curves that grow from the outer ...
Böhm, Christoph, Lauf, Wolfgang
core +1 more source
“Addressing barriers to digital health readiness among a Latino population”
PEC InnovationObjective: There are many potential barriers to an individual's readiness and ability to use telehealth, including technology access, trust and knowledge.
Karla Martin González +9 more
doaj +1 more source
Longer Cycles in Essentially 4-Connected Planar Graphs
Discussiones Mathematicae Graph Theory, 2020 A planar 3-connected graph G is called essentially 4-connected if, for every 3-separator S, at least one of the two components of G − S is an isolated vertex.
Fabrici Igor +3 more
doaj +1 more source
Volume distortion in homotopy groups [PDF]
, 2016 Given a finite metric CW complex $X$ and an element $\alpha \in \pi_n(X)$, what are the properties of a geometrically optimal representative of $\alpha$? We study the optimal volume of $k\alpha$ as a function of $k$.
Manin, Fedor
core +2 more sources
On the trace of random walks on random graphs
, 2017 We study graph-theoretic properties of the trace of a random walk on a random graph. We show that for any $\varepsilon>0$ there exists $C>1$ such that the trace of the simple random walk of length $(1+\varepsilon)n\ln{n}$ on the random graph $G\sim G(n,p)
Frieze, Alan +3 more
core +2 more sources
Minimum eccentric connectivity index for graphs with fixed order and fixed number of pendant vertices [PDF]
Yugoslav Journal of Operations Research, 2019 The eccentric connectivity index of a connected graph G is the sum over all vertices v of the product dG(v)eG(v), where dG(v) is the degree of v in G and eG(v) is the maximum distance between v and any other vertex of G.
Devillez Gauvain +3 more
doaj +1 more source
Functions out of Higher Truncations [PDF]
, 2015 In homotopy type theory, the truncation operator ||-||n (for a number n > -2) is often useful if one does not care about the higher structure of a type and wants to avoid coherence problems.
Capriotti, Paolo +2 more
core +3 more sources