Related papers: Combinatorics of branchings in higher dimensional …
We introduce constructible directed complexes, a combinatorial presentation of higher categories inspired by constructible complexes in poset topology. Constructible directed complexes with a greatest element, called atoms, encompass common…
Multi-robot path planning is difficult due to the combinatorial explosion of the search space with every new robot added. Complete search of the combined state-space soon becomes intractable. In this paper we present a novel form of…
Finite-order invariants of knots in arbitrary 3-manifolds (including non-orientable ones) are constructed and studied by methods of the topology of discriminant sets. Obstructions to the integrability of admissible weight systems to…
Neural Combinatorial Optimization attempts to learn good heuristics for solving a set of problems using Neural Network models and Reinforcement Learning. Recently, its good performance has encouraged many practitioners to develop neural…
We study gauge theories on spacetime manifolds with a codimension-$1$ submanifold with boundary. We characterise the reduced phase space of the theory whenever it is described by a local momentum map for the action of the gauge group…
In this paper, we examine the combinatorial properties of conic arrangements in the complex projective plane that possess certain quasi-homogeneous singularities. First, we introduce a new tool that enables us to characterize the property…
The paper briefly describes a basic set of special combinatorial engineering frameworks for solving complex problems in the field of hierarchical modular systems. The frameworks consist of combinatorial problems (and corresponding models),…
We investigate associativity of multiplications on chain complexes over commutative noetherian rings from two perspectives. First, we introduce a natural associator subcomplex and show how its homology can detect associativity. Second, we…
Black-box complexity is a complexity theoretic measure for how difficult a problem is to be optimized by a general purpose optimization algorithm. It is thus one of the few means trying to understand which problems are tractable for genetic…
The "simplicial complexes" and "join" (*) today used within combinatorics aren't the classical concepts, cf. Spanier (1966) p. 108-9, but, exept for \emptyset, complexes having {\emptyset} as a subcomplex resp. \Sigma1 * \Sigma2 := {\sigma1…
Modern applications of algebraic topology to point cloud data analysis have motivated active investigation of combinatorial clique complexes -- high-dimensional extensions of combinatorial graphs. We show that meaningful invariants of such…
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…
For a certain full additive subcategory X of an additive category A, one defines the lower extension groups in relative homological algebra. We show that these groups are isomorphic to the suspended Hom groups in the Verdier quotient…
Quadratic constrained quadratic programming problems often occur in various fields such as engineering practice, management science, and network communication. This article mainly studies a non convex quadratic programming problem with…
This paper proposes a branched residual network for image classification. It is known that high-level features of deep neural network are more representative than lower-level features. By sharing the low-level features, the network can…
In our previous articles, we have presented a class of endomorphisms of the Cuntz algebras which are defined by polynomials of canonical generators and their conjugates. We showed the classification of some case under unitary equivalence by…
We derive a series of results on random walks on a d-dimensional hypercubic lattice (lattice paths). We introduce the notions of terse and simple paths corresponding to the path having no backtracking parts (spikes). These paths label…
We determine the holonomy of generalized Killing spinor covariant derivatives of the form $D= \nabla + \Omega$ on pseudo-Riemannian reductive homogeneous spaces in a purely algebraic and algorithmic way, where $\Omega : TM \rightarrow…
We study the bounded regions in a generic slice of the hyperplane arrangement in $\mathbb{R}^n$ consisting of the hyperplanes defined by $x_i$ and $x_i+x_j$. The bounded regions are in bijection with several classes of combinatorial…
We study a variety of natural constructions from topological combinatorics, including matching complexes as well as other graph complexes, from the perspective of the graph minor category of \parencite{MiProRa}. We prove that these…