相关论文: Groupoids in combinatorics -- applications of a th…
A transportation polytope consists of all multidimensional arrays or tables of non-negative real numbers that satisfy certain sum conditions on subsets of the entries. They arise naturally in optimization and statistics, and also have…
In this paper, we aim to provide a notion of "relative objects", i.e. objects equipped with some sort of subobjects, in differential topology. In spite of active researches relating them, e.g. knot theory or the theory of manifolds with…
This dissertation investigates the geometric combinatorics of convex polytopes and connections to the behavior of the simplex method for linear programming. We focus our attention on transportation polytopes, which are sets of all tables of…
Distributions, i.e., subsets of tangent bundles formed by piecing together subspaces of tangent spaces, are commonly encountered in the theory and application of differential geometry. Indeed, the theory of distributions is a fundamental…
We give an elementary construction of polyhedra whose links are connected bipartite graphs, which are not necessarily isomorphic pairwise. We show, that the fundamental groups of some of our polyhedra contain surface groups. In particular,…
We examine generalized global symmetries as a kind of compactly supported cohomology, and so are led to revisit questions about the locality of quantum field theory, following Segal. Physics naturally suggests a generalization of…
Cyclic polytopes have been studied since at least the early last century by Caratheodory and others.A generalization is a construction of a class of polytopes such that the polytopes have some of their properties.The best known example is…
We outline the construction of the holonomy groupoid of a locally Lie groupoid and the monodromy groupoid of a Lie groupoid. These specialise to the well known holonomy and monodromy groupoids of a foliation, when the groupoid is just an…
We introduce the classical theory of the interplay between group theory and topology into the context of operads and explore some applications to homotopy theory. We first propose a notion of a group operad and then develop a theory of…
A notion of general manifolds is introduced. It covers all usual manifolds in mathematics. Essentially, it is a way how to get a bigger 'fibration' over a site which locally coincides with a given one. An enrichment with generalized…
Our goal is to develop a limit approach for a class of problems in additive combinatorics that is analogous to the limit theory of dense graph sequences. We introduce metric, convergence and limit objects for functions on groups and for…
This survey is about combinatorial objects related to reflection groups and their applications in representation theory and arithmetic geometry. Coxeter groups and folded galleries in Coxeter complexes are introduced in detail and…
A combinatorial construction is used to analyze the properties of polyhedral products and generalized moment-angle complexes with respect to certain operations on CW pairs including exponentiation. This allows for the construction of…
The main topic is the development of a Fredholm theory in a new class of spaces called M-polyfolds. In the subsequent Volume II the theory will be generalized to an even larger class of spaces called polyfolds, which can also incorporate…
We consider the moduli space of bordered Riemann surfaces with boundary and marked points. Such spaces appear in open-closed string theory, particularly with respect to holomorphic curves with Lagrangian submanifolds. We consider a…
In this paper, we define locally matchable subsets of a group which is extracted from the concept of matchings in groups and used as a tool to give alternative proofs for existing results in matching theory. We also give the linear analogue…
In these lecture notes, we give a quick account of the theory of Poisson groupoids and Lie bialgebroids. In particular, we discuss the universal lifting theorem and its applications including integration of quasi-Lie bialgebroids,…
This is the first in a series of articles devoted to providing a foundation for a theory of flocks of arbitrary cones in PG(3,q). The desire to have such a theory stems from a need to better understand the very significant and applicable…
An extension of order theory is presented that serves as a formalism for the study of dendroidal sets analogously to way the formalism of order theory is used in the study of simplicial sets.
We develop an algorithmic theory of convex optimization over discrete sets. Using a combination of algebraic and geometric tools we are able to provide polynomial time algorithms for solving broad classes of convex combinatorial…