Related papers: Combinatorics of branchings in higher dimensional …
Robust Optimization is becoming increasingly important in machine learning applications. This paper studies the problem of robust submodular minimization subject to combinatorial constraints. Constrained Submodular Minimization arises in…
Sampling from combinatorial families can be difficult. However, complicated families can often be embedded within larger, simpler ones, for which easy sampling algorithms are known. We take advantage of such a relationship to describe a…
The paper contains a survey of train constructions for infinite symmetric groups and related groups. For certain pairs (a group $G$, a subgroup $K$), we construct categories, whose morphisms are two-dimensional surfaces tiled by polygons…
We describe a conjecture on the algebra of higher cohomology operations which leads to the computations of the differentials in the Adams spectral sequence. For this we introduce the notion of an n-th order track category which is suitable…
In this paper, we develop a method to compute the Morse homology of a manifold when descending manifolds and ascending manifolds intersect cleanly, but not necessarily transversely. While obstruction bundle gluing defined by Hutchings and…
In the current research work, our basic objective is to investigate the stucture of Hom-associative trialgebras. Next, we build up one important class of Hom-associative trialgebras and provide properties of right, left and meddle…
This paper addresses the question of how categorical symmetries act on extended operators in quantum field theory. Building on recent results in two dimensions, we introduce higher tube categories and algebras associated to higher fusion…
Tandem duplication is an evolutionary process whereby a segment of DNA is replicated and proximally inserted. The different configurations that can arise from this process give rise to some interesting combinatorial questions. Firstly, we…
Representing a proof tree by a combinator term that reduces to the tree lets subtle forms of duplication within the tree materialize as duplicated subterms of the combinator term. In a DAG representation of the combinator term these…
In this paper, we study a number of well-known combinatorial optimization problems that fit in the following paradigm: the input is a collection of (potentially inconsistent) local relationships between the elements of a ground set (e.g.,…
Let $k$ be an algebraically closed field and $\alpha$, $\beta$, $\gamma$ be partitions. An algebraic group acts on the constructible set of short exact sequences of nilpotent $k$-linear operators of Jordan types $\alpha$, $\beta$, and…
The aim of this work is to develop a systematic manner to close overdetermined systems arising from conformal Killing tensors (CKT). The research performs this action for 1-tensor and 2-tensors. This research makes it possible to develop a…
This paper examines the use of a hierarchical coevolutionary genetic algorithm under different partnering strategies. Cascading clusters of sub-populations are built from the bottom up, with higher-level sub-populations optimising larger…
In this paper we consider two aspects of the inverse problem of how to construct merge trees realizing a given barcode. Much of our investigation exploits a recently discovered connection between the symmetric group and barcodes in general…
The present article is an exposition of a theory of discrete convex functions on certain graph structures, developed by the author in recent years. This theory is a spin-off of discrete convex analysis by Murota, and is motivated by…
We develop a graphical calculus of manifold diagrams which generalises string and surface diagrams to arbitrary dimensions. Manifold diagrams are pasting diagrams for $(\infty, n)$-categories that admit a semi-strict composition operation…
Given a graph $G=(V,E)$, the minimum branch vertices problem consists in finding a spanning tree $T=(V,E')$ of $G$ minimizing the number of vertices with degree greater than two. We consider a simple combinatorial lower bound for the…
Constructing complex computation from simpler building blocks is a defining problem of computer science. In algebraic automata theory, we represent computing devices as semigroups. Accordingly, we use mathematical tools like products and…
This survey revisits classical combinatorial optimization algorithms and extends them to two-stage stochastic models, particularly focusing on client-element problems. We reformulate these problems to optimize element selection under…
Developing an idea of Kapranov and Voevodsky, we introduce a model of weak omega-categories based on directed complexes, combinatorial presentations of pasting diagrams. We propose this as a convenient framework for higher-dimensional…