Related papers: On composition and decomposition operations for ve…
If V is the vertex sequence of a symmetric 2t-cycle in the hypercube graph with the vertices {1,-1}^t, then for any vertex T of the graph there exists a unique inclusion-minimal subset of V such that T is the sum of its elements. We present…
It is known that problems like Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal are polynomial time solvable in the class of chordal graphs. We consider these problems in a graph that has at most $k$ vertices whose deletion…
Starting from a detailed analysis of the structure of pathspaces of the ${\cal A}$-fusion graphs and the corresponding irreducible Virasoro algebra quotients $V(c,h)$ for the ($2,q$ odd) models, we introduce the notion of an admissible…
For linear operators which factor with suitable assumptions concerning commutativity of the factors, we introduce several notions of a decomposition. When any of these hold then questions of null space and range are subordinated to the same…
In this paper, we propose a general sparse decomposition of dynamical systems provided that the vector field and constraint set possess certain sparse structures, which we call subsystems. This notion is based on causal dependence in the…
Many resource allocation problems in the cloud can be described as a basic Virtual Network Embedding Problem (VNEP): finding mappings of request graphs (describing the workloads) onto a substrate graph (describing the physical…
In this paper decomposition of periodic orbits in bifurcation diagrams are derived in unidimensional dynamics system $x_{n+1}=f(x_{n};r)$, being $f$ an unimodal function. We proof a theorem which states the necessary and sufficient…
Let $G$ be a linearly reductive group acting on a vector space $V$, and $f$ a (semi-)invariant polynomial on $V$. In this paper we study systematically decompositions of the Bernstein-Sato polynomial of $f$ in parallel with some…
The Vertex Separator Problem (VSP) on a graph is the problem of finding the smallest collection of vertices whose removal separates the graph into two disjoint subsets of roughly equal size. Recently, Hager and Hungerford [1] developed a…
Convexity is a notion that has been defined for subsets of $\RR^n$ and for subsets of general graphs. A convex cut of a graph $G=(V, E)$ is a $2$-partition $V_1 \dot{\cup} V_2=V$ such that both $V_1$ and $V_2$ are convex, \ie shortest paths…
We introduce ideas that complement the many known connections between polymatroids and graph coloring. Given a hypergraph that satisfies certain conditions, we construct polymatroids, given as rank functions, that can be written as sums of…
The question of whether there is a logic that captures polynomial time is one of the main open problems in descriptive complexity theory and database theory. In 2010 Grohe showed that fixed point logic with counting captures polynomial time…
We present time-efficient distributed algorithms for decomposing graphs with large edge or vertex connectivity into multiple spanning or dominating trees, respectively. As their primary applications, these decompositions allow us to achieve…
An ordered graph is a graph enhanced with a linear order on the vertex set. An ordered graph is a core if it does not have an order-preserving homomorphism to a proper subgraph. We say that $H$ is the core of $G$ if (i) $H$ is a core, (ii)…
We show that a cooperative game may be decomposed into a sum of component games, one for each player, using the combinatorial Hodge decomposition on a graph. This decomposition is shown to satisfy certain efficiency, null-player, symmetry,…
Consider a collection of vector subspaces of a given vector space and a collection of projectors on these vector spaces, can we decompose the vector space into a product of vector subspaces such that the projectors are isomorphic to…
We present an overlapping Schwarz decomposition algorithm for constrained quadratic programs (QPs). Schwarz algorithms have been traditionally used to solve linear algebra systems arising from partial differential equations, but we have…
Suppose that there is a ground set which consists of a large number of vectors in a Hilbert space. Consider the problem of selecting a subset of the ground set such that the projection of a vector of interest onto the subspace spanned by…
In many models for large-scale computation, decomposition of the problem is key to efficient algorithms. For distance-related graph problems, it is often crucial that such a decomposition results in clusters of small diameter, while the…
Suppose a finite, unweighted, combinatorial graph $G = (V,E)$ is the union of several (degree-)regular graphs which are then additionally connected with a few additional edges. $G$ will then have only a small number of vertices $v \in V$…