English
Related papers

Related papers: Finding large counterexamples by selectively explo…

200 papers

Finding, counting and/or listing triangles (three vertices with three edges) in large graphs are natural fundamental problems, which received recently much attention because of their importance in complex network analysis. We provide here a…

Data Structures and Algorithms · Computer Science 2007-05-23 Matthieu Latapy

A celebrated result concerning triangulations of a given closed 3-manifold is that any two triangulations with the same number of vertices are connected by a sequence of so-called 2-3 and 3-2 moves. A similar result is known for ideal…

Geometric Topology · Mathematics 2019-06-28 J. Hyam Rubinstein , Henry Segerman , Stephan Tillmann

Let $M$ be a compact 3--manifold with boundary a single torus. We present upper and lower complexity bounds for closed 3--manifolds obtained as even Dehn fillings of $M.$ As an application, we characterise some infinite families of even…

Geometric Topology · Mathematics 2025-03-12 William Jaco , J. Hyam Rubinstein , Jonathan Spreer , Stephan Tillmann

Conjunctive queries select and are expected to return certain tuples from a relational database. We study the potentially easier problem of counting all selected tuples, rather than enumerating them. In particular, we are interested in the…

Computational Complexity · Computer Science 2019-04-30 Holger Dell , Marc Roth , Philip Wellnitz

A large amount of literature in social choice theory deals with quantifying the probability of certain election outcomes. One way of computing the probability of a specific voting situation under the Impartial Anonymous Culture assumption…

Optimization and Control · Mathematics 2014-06-23 Achill Schürmann

We compute the number of triangulations of a convex $k$-gon each of whose sides is subdivided by $r-1$ points. We find explicit formulas and generating functions, and we determine the asymptotic behaviour of these numbers as $k$ and/or $r$…

Combinatorics · Mathematics 2017-02-06 Andrei Asinowski , Christian Krattenthaler , Toufik Mansour

We prove that in a closed Riemannian manifold with dimension between $3$ and $7$, either there are minimal hypersurfaces with arbitrarily large area, or there exist uncountably many stable minimal hypersurfaces. Moreover, the latter case…

Differential Geometry · Mathematics 2024-05-28 James Stevens , Ao Sun

Tight triangulated manifolds are generalisations of neighborly triangulations of closed surfaces and are interesting objects in Combinatorial Topology. Tight triangulated manifolds are conjectured to be minimal. Except few, all the known…

Geometric Topology · Mathematics 2015-06-02 Basudeb Datta

We prove that if an $n$-dimensional space $X$ satisfies certain topological conditions then any triangulation of $X$ as well as any its representation as a simplicial set with contractible faces has at least $2^n$ faces of dimension $n$.…

Algebraic Topology · Mathematics 2024-08-07 Sergey Avvakumov , Roman Karasev

Gay and Kirby recently introduced the concept of a trisection for arbitrary smooth, oriented closed 4-manifolds, and with it a new topological invariant, called the trisection genus. This paper improves and implements an algorithm due to…

Geometric Topology · Mathematics 2018-10-24 Jonathan Spreer , Stephan Tillmann

We revisit the problem of counting the number of copies of a fixed graph in a random graph or multigraph, including the case of constrained degrees. Our approach relies heavily on analytic combinatorics and on the notion of patchwork to…

The spectrum of a tensor-triangulated category carries a compact Hausdorff topology, called the constructible topology, also known as the patch topology. We prove that patch-dense subsets detect tt-ideals and we prove that any infinite…

Category Theory · Mathematics 2025-03-20 Paul Balmer , Martin Gallauer

Understanding the higher-order interactions within network data is a key objective of network science. Surveys of metadata triangles (or patterned 3-cycles in metadata-enriched graphs) are often of interest in this pursuit. In this work, we…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-07-27 Trevor Steil , Tahsin Reza , Keita Iwabuchi , Benjamin W. Priest , Geoffrey Sanders , Roger Pearce

The spine of a trisected 4-manifold is a singular 3-dimensional set from which the trisection itself can be reconstructed. 3-manifolds embedded in the trisected 4--manifold can often be isotoped to lie almost or entirely in the spine of the…

Geometric Topology · Mathematics 2018-06-14 Dale Koenig

We introduce a numerical isomorphism invariant p(T) for any triangulation T of S^3. Although its definition is purely topological (inspired by the bridge number of knots), p(T) reflects the geometric properties of T. Specifically, if T is…

Geometric Topology · Mathematics 2016-09-07 Simon A. King

A celebrated conjecture of Tuza states that in any finite graph the minimum size of a cover of triangles by edges is at most twice the maximum size of a set of edge-disjoint triangles. For an $r$-uniform hypergraph ($r$-graph) $G$, let…

Combinatorics · Mathematics 2024-05-15 Abdul Basit , David Galvin

We consider closed acylindrical surfaces in 3-manifolds and in knot and link complements, and show that the genus of these surfaces is bounded linearly by the number of tetrahedra in the triangulation of the manifold and by the number of…

Geometric Topology · Mathematics 2009-09-29 Mario Eudave-Munoz , Max Neumann-Coto

Let M be an arithmetic hyperbolic 3-manifold, such as a Bianchi manifold. We conjecture that there is a basis for the second homology of M, where each basis element is represented by a surface of `low' genus, and give evidence for this. We…

Number Theory · Mathematics 2016-08-17 Nicolas Bergeron , Mehmet Haluk Sengun , Akshay Venkatesh

Counterfactual examples have emerged as an effective approach to produce simple and understandable post-hoc explanations. In the context of graph classification, previous work has focused on generating counterfactual explanations by…

Machine Learning · Computer Science 2023-07-28 Carlo Abrate , Giulia Preti , Francesco Bonchi

We prove the existence of pure braids with arbitrarily many strands which are small, i.e. they contain no closed incompressible surface in the complement which is not boundary parallel. This implies the existence of irreducible non-Haken…

Geometric Topology · Mathematics 2007-05-23 Ian Agol