Related papers: Decomposition of multiple packings with subquadrat…

A Hamilton decomposition of a graph is a partitioning of its edge set into disjoint spanning cycles. The existence of such decompositions is known for all hypercubes of even dimension $2n$. We give a decomposition for the case $n = 2^a3^b$…

In this paper, we study a polynomial decomposition model that arises in problems of system identification, signal processing and machine learning. We show that this decomposition is a special case of the X-rank decomposition --- a powerful…

Let $F_k$ be the set of graphs on $k$ vertices. For a graph $G$, a $k$-decomposition is a set of induced subgraphs of $G$, each isomorphic to an element of $F_k$, such that each pair of vertices of $G$ is in exactly one element of the set.…

It is known that, among all the monotone decompositions of a planar compact set K with Peano hyperspaces, there exists a unique one that is finer than all the others. We call it the "core decomposition" of K with Peano hyperspace. The…

Let G be a complex reductive Lie group acting on a compact K\"ahler manifold X and assume that the action of a maximal compact subgroup K of G is Hamiltonian. For each extreme point of the convex hull of the momentum map image, there is an…

A Hamilton cycle in a graph $\Gamma$ is a cycle passing through every vertex of $\Gamma$. A Hamiltonian decomposition of $\Gamma$ is a partition of its edge set into disjoint Hamilton cycles. One of the oldest results in graph theory is…

We prove that every tree on $n$ edges decomposes $K_{nx,nx}$ and $K_{2nx + 1}$ for all positive integers $x$. The said decompositions are obtained by proving that every tree admits a $\vec{\beta}$-labeling (oriented beta-labeling). Our…

Let $X$ be a smooth projective geometrically irreducible curve over a perfect field $k$ of positive characteristic $p$. Suppose $G$ is a finite group acting faithfully on $X$ such that $G$ has non-trivial cyclic Sylow $p$-subgroups. We show…

A decomposition of $K_{n(g)}\setminus L$, the complete n-partite equipartite graph with a subgraph L (called the leave) removed, into edge disjoint copies of a graph G is called a maximum group divisible packing of $K_{n(g)}$ with G if L…

A $k$-block in a graph $G$ is a maximal set of at least $k$ vertices no two of which can be separated in $G$ by removing less than $k$ vertices. It is separable if there exists a tree-decomposition of adhesion less than $k$ of $G$ in which…

We compute the number of ways a given permutation can be written as a product of exactly $k$ transpositions. We express this number as a linear combination of explicit geometric sequences, with coefficients which can be computed in many…

Let $P$ be a set of $n$ points on the plane in general position. We say that a set $\Gamma$ of convex polygons with vertices in $P$ is a convex decomposition of $P$ if: Union of all elements in $\Gamma$ is the convex hull of $P,$ every…

We show that the union of $n$ translates of a convex body in $\mathbb{R}^3$ can have $\Theta(n^3)$ holes in the worst case, where a hole in a set $X$ is a connected component of $\mathbb{R}^3 \setminus X$. This refutes a 20-year-old…

A solution concept on a class of transferable utility coalitional games is a multifunction satisfying given criteria of economic rationality. Every solution associates a set of payoff allocations with a coalitional game. This general…

A mathematical method for constructing fractal curves and surfaces, termed the $p\lambda n$ fractal decomposition, is presented. It allows any function to be split into a finite set of fractal discontinuous functions whose sum is equal…

A subset of Euclidean space will be said to be $n$-smooth if it has an $n$-dimensional tangent plane at each of its points. Let ${\frak d}_n$ denote the least number $n$-smooth sets into which $n+1$-dimensional Euclidean space can be…

Let $F=\{H_1,...,H_k\}$ be a family of graphs. A graph $G$ with $m$ edges is called {\em totally $F$-decomposable} if for {\em every} linear combination of the form $\alpha_1 e(H_1) + ... + \alpha_k e(H_k) = m$ where each $\alpha_i$ is a…

The famous Gallai's Conjecture states that any connected graph with n vertices has a path decomposition containing at most (n+1)/2 paths. In this note, we explore graphs generated from removing edges from complete graphs. We first provide…

Let $X$ be a finite collection of sets. We count the number of ways a disjoint union of $n-1$ subsets in $X$ is a set in $X$, and estimate this number from above by $|X|^{c(n)}$ where $$ c(n)=\left(1-\frac{(n-1)\ln (n-1)}{n\ln n}…

A smooth compactification X<n> of the configuration space of n distinct labeled points in a smooth algebraic variety X is constructed by a natural sequence of blowups, with the full symmetry of the permutation group S_n manifest at each…