Search results
From MaRDI portal
- proof assistant 2024-12-16 Paper Polygraphs: From Rewriting to Higher Categories 2023-12-01 Paper Shuffle polygraphic resolutions for operads 2023-08-22...10 bytes (14 words) - 08:01, 7 October 2023
- Combinatorics of higher-categorical diagrams N/A Paper A model for the coherent walking $\omega$-equivalence N/A Paper...10 bytes (13 words) - 22:57, 24 September 2023
- of a type theory N/A Paper Coherence in cartesian theories using rewriting N/A Paper Delooping generated groups in homotopy type theory N/A Paper...10 bytes (13 words) - 07:07, 7 October 2023
- Publication Type https://portal.mardi4nfdi.de/entity/Q6198052 2024-02-20 Paper Polygraphs: From Rewriting to Higher Categories 2023-12-01 Paper A categorical characterization...10 bytes (13 words) - 18:44, 6 October 2023
- https://portal.mardi4nfdi.de/entity/Q4788622 2002-01-01 Paper Hilbert schemes, polygraphs and the Macdonald positivity conjecture 2001-07-05 Paper Identities and...10 bytes (16 words) - 15:48, 12 December 2023
- Publication Type Polygraphic homology of local systems 2024-05-30 Paper Homologie polygraphique des syst\`emes locaux 2023-09-19 Paper Comparison of \(n\)-categorical...10 bytes (13 words) - 08:37, 7 October 2023
- mardi4nfdi.de/entity/Q4394828 1998-06-11 Paper Distance-related invariants on polygraphs 1998-04-08 Paper Recognizing Cartesian graph bundles 1997-11-25 Paper...10 bytes (15 words) - 19:50, 8 December 2023
- Publication Date of Publication Type Byzantine consensus is \(\Theta(n^2)\): the Dolev-Reischuk bound is tight even in partial synchrony! 2024-07-26...10 bytes (13 words) - 03:02, 7 October 2023
- the Bruhat order 2005-08-01 Paper Expected reflection distance in \(G(r,1,n)\) after a fixed number of reflections 2005-04-28 Paper Directed subgraph complexes...10 bytes (13 words) - 23:41, 24 September 2023
- Graphs is Logarithmic N/A Paper Catching a robber on a random $k$-uniform hypergraph N/A Paper Cops and Robber on Hyperbolic Manifolds N/A Paper...10 bytes (15 words) - 19:26, 8 December 2023
- de/entity/Q3649252 2009-12-03 Paper On functionalized fullerenes \(C_{60} X_{n }\) 2009-07-13 Paper https://portal.mardi4nfdi.de/entity/Q5454385 2008-03-28...10 bytes (13 words) - 16:32, 12 December 2023
- product of graphs 2022-12-08 Paper New bounds on the existence of \((n_5)\) and \((n_6)\) configurations: the Grünbaum calculus revisited 2022-11-24 Paper...10 bytes (15 words) - 14:02, 10 December 2023
- properly colored even cycles: A full characterization 2023-10-04 Paper Tur\'{a}n numbers of general hypergraph star forests 2023-06-13 Paper Spectral radius...10 bytes (14 words) - 19:22, 8 December 2023
- 3-rainbow index of a graph 2015-03-04 Paper Graphs with 3-rainbow index \(n-1\) and \(n-2\) 2015-03-04 Paper The generalized 3-connectivity of random graphs...10 bytes (15 words) - 15:28, 9 December 2023
- Publication Date of Publication Type Byzantine consensus is \(\Theta(n^2)\): the Dolev-Reischuk bound is tight even in partial synchrony! 2024-07-26...10 bytes (15 words) - 16:16, 6 October 2023
- delays Termination orders for 3-polygraphs Recommendations Distance-related invariants on polygraphs 👍 👎 Polygraphs of finite derivation type 👍 👎 On...15 bytes (417 words) - 01:51, 31 January 2024
- globular categories as a natural environment for the theory of weak \(n\)-categories Polygraphs of finite derivation type On closed categories of functors On Lexicographically...15 bytes (639 words) - 01:06, 2 February 2024
- categories via polygraphic resolutions Monoidal globular categories as a natural environment for the theory of weak \(n\)-categories Polygraphs of finite derivation...15 bytes (494 words) - 10:57, 3 February 2024
- A.Carboni and P.T.Johnstone, that the category of non-unital polygraphs, i.e. polygraphs where the source and target of each generator are not identity...15 bytes (464 words) - 00:50, 9 February 2024
- of a polygraph to its normal form, then we prove that acyclicity is equivalent to the existence of a normalisation strategy. Using acyclic polygraphs, we...15 bytes (754 words) - 04:26, 30 January 2024
