Related papers: Notes on Computational Graph and Jacobian Accumula…
Combinatorial optimization problems are typically tackled by the branch-and-bound paradigm. We propose a new graph convolutional neural network model for learning branch-and-bound variable selection policies, which leverages the natural…
Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations, one for vertices and one for faces.…
We use computational linear algebra and commutative algebra to study spaces of relations satisfied by quadrilinear operations. The relations are analogues of associativity in the sense that they are quadratic (every term involves two…
Geometric Algebra and Calculus are mathematical languages encoding fundamental geometric relations that theories of physics seem to respect. We propose criteria given which statistics of expressions in geometric algebra are computable in…
Building on recent work of Robertson and Steger, we associate a C*-algebra to a combinatorial object which may be thought of as a higher rank graph. This C*-algebra is shown to be isomorphic to that of the associated path groupoid.…
Conjunctive table algebras are introduced and axiomatically characterized. A conjunctive table algebra is a variant of SPJR algebra (a weaker form of relational algebra), which corresponds to conjunctive queries with equality. The table…
Many well-known graph drawing techniques, including force directed drawings, spectral graph layouts, multidimensional scaling, and circle packings, have algebraic formulations. However, practical methods for producing such drawings…
computable functions are defined by abstract finite deterministic algorithms on many-sorted algebras. We show that there exist finite universal algebraic specifications that specify uniquely (up to isomorphism) (i) all abstract computable…
Compact representations of objects is a common concept in computer science. Automated planning can be viewed as a case of this concept: a planning instance is a compact implicit representation of a graph and the problem is to find a path (a…
In this paper we study a construction of algebraic curves from combinatorial data. In the study of algebraic curves through degeneration, graphs usually appear as the dual intersection graph of the central fiber. Properties of such graphs…
This paper proposes a framework that formulates a wide range of graph combinatorial optimization problems using permutation-based representations. These problems include the travelling salesman problem, maximum independent set, maximum cut,…
Graph compositions generalize both integer compositions and partitions of a finite set. We develop formulas, generating functions and recurrence relations for composition counting functions for several families of graphs.
We enumerate the connected graphs that contain a number of edges growing linearly with respect to the number of vertices. So far, only the first term of the asymptotics and a bound on the error were known. Using analytic combinatorics, ie…
In the paper, a method of describing the outer derivations of the group algebra of a finitely presentable group is given. The description of derivations is given in terms of characters of the groupoid of the adjoint action of the group.
Simplification of fractional powers of positive rational numbers and of sums, products and powers of such numbers is taught in beginning algebra. Such numbers can often be expressed in many ways, as this article discusses in some detail.…
We give an overview of combinatorial methods to represent 3D data, such as graphs and meshes, from the viewpoint of their amenability to analysis using machine learning algorithms. We highlight pros and cons of various representations and…
Cylindrical algebraic decomposition (CAD) is an important tool for the study of real algebraic geometry with many applications both within mathematics and elsewhere. It is known to have doubly exponential complexity in the number of…
Using representation theory techniques we prove that various spaces of derivations or one-sided multipliers over certain operator algebras are reflexive. A sample result: any bounded local derivation (local left multiplier) on an…
In this paper, we address a class of specially structured problems that include speed planning, for mobile robots and robotic manipulators, and dynamic programming. We develop two new numerical procedures, that apply to the general case and…
We study the correspondence assigning the vertices of a certain quotient of the local Bruhat-Tits tree for the general linear group over a global function field, to conjugacy classes of maximal orders in some quaternion algebras. The…