Related papers: High-level methods for homotopy construction in as…

In the past decade, we had developed a series of splitting contraction algorithms for separable convex optimization problems, at the root of the alternating direction method of multipliers. Convergence of these algorithms was studied under…

Counting the number of answers to conjunctive queries is a fundamental problem in databases that, under standard assumptions, does not have an efficient solution. The issue is inherently #P-hard, extending even to classes of acyclic…

Let ${\mathscr{C}}$ be an $n$-cluster tilting subcategory of an exact category $({\mathscr{A}}, {\mathscr{E}})$, where $n \geq 1$ is an integer. It is proved by Jasso that if $n> 1$, then ${\mathscr{C}}$ although is no longer exact, but has…

We demonstrate how by using a reinforcement learning algorithm, the deep cross-entropy method, one can find explicit constructions and counterexamples to several open conjectures in extremal combinatorics and graph theory. Amongst the…

The homotopy theory of higher categorical structures has become a relevant part of the machinery of algebraic topology and algebraic K-theory, and this paper contains contributions to the study of the relationship between B\'enabou's…

We show that basic homotopical notions such as homotopy sets and groups, connected and truncated maps, cellular constructions and skeleta, etc., extend to the setting of $(\infty,\infty)$-categories, as well as to presentable categories…

We introduce the Insertion Chain Complex, a higher-dimensional extension of insertion graphs, as a new framework for analyzing finite sets of words. We study its topological and combinatorial properties, in particular its homology groups,…

We introduce a new combinatorial structure: the superselector. We show that superselectors subsume several important combinatorial structures used in the past few years to solve problems in group testing, compressed sensing, multi-channel…

Informally, a homotopy monoid is a monoid-like structure in which properties such as associativity only hold `up to homotopy' in some consistent way. This short paper comprises a rigorous definition of homotopy monoid and a brief analysis…

We develop a localisation theory for certain categories, yielding a 3-arrow calculus: Every morphism in the localisation is represented by a diagram of length 3, and two such diagrams represent the same morphism if and only if they can be…

The basic notions of category theory, such as limit, adjunction, and orthogonality, all involve assertions of the existence and uniqueness of certain arrows. Weak notions arise when one drops the uniqueness requirement and asks only for…

We define a family of convex polytopes called constrainahedra, which index collisions of horizontal and vertical lines. Our construction proceeds by first defining a poset $C(m,n)$ of good rectangular preorders, then proving that $C(m,n)$…

In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constructions of objects with such properties are often very difficult, or…

We present a homotopy theory for a weak version of modular operads whose compositions and contractions are only defined up to homotopy. This homotopy theory takes the form of a Quillen model structure on the collection of simplicial…

Given an $n$-gon, the poset of all collections of pairwise non-crossing diagonals is isomorphic to the face poset of some convex polytope called \textit{associahedron}. We replace in this setting the $n$-gon (viewed as a disc with $n$…

In this article we study homotopes of finite-dimensional algebras (not necessarily, associative). In the case of associative algebras we study homotopes by methods of Category theory and give description of so-called well-tempered elements…

The results of this thesis allows one to replace calculations in tricategories with equivalent calculations in Gray categories (aka semistrict tricategories). In particular the rewriting calculus for Gray categories as used for example by…

This paper lays the foundations of an approach to applying Gromov's ideas on quantitative topology to topological data analysis. We introduce the "contiguity complex", a simplicial complex of maps between simplicial complexes defined in…

We construct a Goodwillie tower of categories which interpolates between the category of pointed spaces and the category of spectra. This tower of categories refines the Goodwillie tower of the identity functor in a precise sense. More…

Constructions of spectra from symmetric monoidal categories are typically functorial with respect to strict structure-preserving maps, but often the maps of interest are merely lax monoidal. We describe conditions under which one can…