Related papers: Partitions of $n$-valued maps

A graph is a split graph if its vertex set can be partitioned into a clique and a stable set. A split graph is unbalanced if there exist two such partitions that are distinct. Cheng, Collins and Trenk (2016), discovered the following…

Using kicked differential equations of motion with derivatives of noninteger orders, we obtain generalizations of the dissipative standard map. The main property of these generalized maps, which are called fractional maps, is long-term…

A graph is split if there is a partition of its vertex set into a clique and an independent set. The present paper is devoted to the splitness of some graphs related to finite simple groups, namely, prime graphs and solvable graphs, and…

We derive an exact path integral formulation for the partition function for the Ising model using a mapping between spins and poles of a Laurent expansion for a field on the complex plane. The advantage in using this formulation for the…

The fixing number of a graph $G$ is the smallest cardinality of a set of vertices $F\subseteq V(G)$ such that only the trivial automorphism of $G$ fixes every vertex in $F$. Let $\Pi$ $=$ $\{F_1,F_2,\ldots,F_k\}$ be an ordered $k$-partition…

The paper contains an exposition of part of topology using partitions of unity. The main idea is to create variants of the Tietze Extension Theorem and use them to derive classical theorems. This idea leads to a new result generalizing…

The directions of an infinite graph $G$ are a tangle-like description of its ends: they are choice functions that choose compatibly for all finite vertex sets $X\subseteq V(G)$ a component of $G-X$. Although every direction is induced by a…

The number of partitions of $n$ wherein odd parts are distinct and even parts are unrestricted, often denoted by $pod(n)$. In this paper, we provide linear recurrence relations for $pod(n)$, and the connections of $pod(n)$ with other…

We determine the cardinality of the value sets of bivariate Chebyshev maps over finite fields. We achieve this using the dynamical properties of these maps and the algebraic expressions of their fixed points in terms of roots of unity.

The central purpose of this article is to establish new inverse and implicit function theorems for differentiable maps with isolated critical points. One of the key ingredients is a discovery of the fact that differentiable maps with…

We introduce a new subclass of chordal graphs that generalizes split graphs, which we call well-partitioned chordal graphs. Split graphs are graphs that admit a partition of the vertex set into cliques that can be arranged in a star…

For each integer q>0 there is a cohomology theory such that the zero cohomology group of a manifold N of dimension n is a certain group of cobordism classes of proper fold maps of manifolds of dimension n+q into N. We prove a splitting…

We adapt the theory of partition rank and analytic rank to the category of abelian groups. If $A_1, \dots, A_k$ are finite abelian groups and $\phi : A_1 \times \cdots \times A_k \to \mathbf{T}$ is a multilinear map, where $\mathbf{T} =…

A geometrical approach to the calculation of N-point Feynman diagrams is reviewed. It is shown that the geometrical splitting yields useful connections between Feynman integrals with different momenta and masses. It is demonstrated how…

Building on the work of the fourth author in math.AG/9904074, we prove the weak factorization conjecture for birational maps in characteristic zero: a birational map between complete nonsingular varieties over an algebraically closed field…

We construct and study the space C(\R^d,n) of all partitions of \R^d into n non-empty open convex regions (n-partitions). A representation on the upper hemisphere of an n-sphere is used to obtain a metric and thus a topology on this space.…

In the branch of mathematics known as graph theory, graphs are considered as a set of points, called vertices, with connections between these points, called edges. The purpose of this paper is to study mappings between two graphs that have…

A map $f: \ff^n \to \ff^n$ over a field $\ff$ is called affine if it is of the form $f(x)=Ax+b$, where the matrix $A \in \ff^{n\times n}$ is called the linear part of affine map and $b \in \ff^n$. The affine maps over $\ff=\rr$ or $\cc$ are…

Let G be a graph. The (unlabeled) configuration space of n points on G is the space of all n-element subsets of G. The fundamental group of such a configuration space is called a graph braid group. We use a version of discrete Morse theory…

For $n \in \mathbb{N}$ let $\Pi[n]$ denote the set of partitions of $n$, i.e., the set of positive integer tuples $(x_1,x_2,\ldots,x_k)$ such that $x_1 \geq x_2 \geq \cdots \geq x_k$ and $x_1 + x_2 + \cdots + x_k = n$. Fixing…