An [a, b] path partition is a decomposition of the edges of a graph into a independent path sets and b matchings, where an independent path set is a set of paths that do not intersect each other. The path partition problem is related to other edge partition problems, such as edge coloring. It is shown that every graph with maximum degree 3 has a [LO] path partition, and every graph with maximum...

An {em Italian dominating function} on a digraph $D$ with vertex set $V(D)$ is defined as a function$fcolon V(D)to {0, 1, 2}$ such that every vertex $vin V(D)$ with $f(v)=0$ has at least two in-neighborsassigned 1 under $f$ or one in-neighbor $w$ with $f(w)=2$. A set ${f_1,f_2,ldots,f_d}$ of distinctItalian dominating functions on $D$ with the property that $sum_{i=1}^d f_i(v)le 2$ for each $vi...

We study classic cake-cutting problems, but in discrete models rather than using infiniteprecision real values, specifically, focusing on their communication complexity. Using general discrete simulations of classical infinite-precision protocols (Robertson-Webb and movingknife), we roughly partition the various fair-allocation problems into 3 classes: “easy” (constant number of rounds of logar...

We present recent developments of irregular conformal conformal states. Irregular vertex operators and their adjoint in a new formalism are used to define the irregular conformal states and their inner product instead of using the colliding limit procedure. Free field formalism can be augmented by screening operators which provide more degrees of freedom. The inner product is conveniently given...

The point-line geometry known as a partial quadrangle (introduced by Cameron in 1975) has the property that for every point/line non-incident pair (P, `), there is at most one line through P concurrent with `. So in particular, the well-studied objects known as generalised quadrangles are each partial quadrangles. An intriguing set of a generalised quadrangle is a set of points which induces an...

A graph G is list point k-arborable if, whenever we are given a k-list assignment L(v) of colors for each vertex v ∈ V(G), we can choose a color c(v) ∈ L(v) for each vertex v so that each color class induces an acyclic subgraph of G, and is equitable list point k-arborable if G is list point k-arborable and each color appears on at most ⌈|V(G)|/k⌉ vertices of G. In this paper, we conjecture tha...

Let D be a finite and simple digraph with vertex set V (D), and let f : V (D)→ {−1,1} be a two-valued function. If k ≥ 1 is an integer and ∑x∈N−[v] f (x) ≥ k for each v∈V (D), where N−[v] consists of v and all vertices of D from which arcs go into v, then f is a signed k-dominating function on D. A set { f1, f2, . . . , fd} of distinct signed k-dominating functions of D with the property that ∑...

This paper investigates how to make decentralised networks, amenable to external control, i.e., how to ensure that they are appropriately organised so that they can be effectively ‘reprogrammed’. In particular, we study networked systems whose interaction dynamics are given by a nearest-neighbour averaging rule, with one leader node providing the control input to the entire system. The main res...

In this paper, we provide theoretical justification for the application of higher degree fuzzy transform in time series analysis. Under the assumption that a time series can be additively decomposed into a trend-cycle, a seasonal component and a random noise, we demonstrate that the higher degree fuzzy transform technique can be used for the estimation of the trend-cycle, which is one of the ba...