Related papers: The Langberg-M\'{e}dard Multiple Unicast Conjectur…

Let G=(V,E) be a simple undirected graph. For a given set L of the real line, a function omega from E to L is called an L-flow. Given a vector gamma whose coordinates are indexed by V, we say that omega is a gamma-L-flow if for each v in V,…

We approach the problem of obtaining branching rules from the point of view of dual reductive pairs. Specifically, we obtain a stable branching rule for each of 10 classical families of symmetric pairs. In each case, the branching…

This paper investigates the many-to-one throughput capacity (and by symmetry, one-to-many throughput capacity) of IEEE 802.11 multi-hop networks. It has generally been assumed in prior studies that the many-to-one throughput capacity is…

The dynamics and the stationary states of an exactly solvable three-state layered feed-forward neural network model with asymmetric synaptic connections, finite dilution and low pattern activity are studied in extension of a recent work on…

Thermal convection in an inclined layer between two parallel walls kept at different fixed temperatures is studied for fixed Prandtl number Pr=1.07. Depending on the angle of inclination and the imposed temperature difference, the flow…

We consider stability of scheduled multiaccess message communication with random coding and joint maximum-likehood decoding of messages. The framework we consider here models both the random message arrivals and the subsequent reliable…

A balanced pair in an ordered set $P=(V,\leq)$ is a pair $(x,y)$ of elements of $V$ such that the proportion of linear extensions of $P$ that put $x$ before $y$ is in the real interval $[1/3, 2/3]$. We define the notion of a good pair and…

An $r$-uniform hypergraph ($r$-graph) is linear if any two edges intersect at most one vertex. For a graph $F$, a hypergraph $H$ is Berge-$F$ if there is a bijection $\phi:E(F)\rightarrow E(H)$ such that $e\subseteq \phi(e)$ for all $e$ in…

Recently much attention has been paid to the study of the robustness of interdependent and multiplex networks and, in particular, networks of networks. The robustness of interdependent networks can be evaluated by the size of a mutually…

Let $M$ be a $3$-connected matroid. A pair $\{e,f\}$ in $M$ is detachable if $M \backslash e \backslash f$ or $M / e / f$ is $3$-connected. Williams (2015) proved that if $M$ has at least 13 elements, then at least one of the following…

We prove a conjecture of Menasco and Zhang that if a tangle is completely tubing compressible then it consists of at most two families of parallel strands. This is related to problems of graphs in 3-manifold. A 1-vertex graph $\Gamma$ in a…

We analyse the exponential stability properties of a class of measure-valued equations arising in nonlinear multi-target filtering problems. We also prove the uniform convergence properties w.r.t. the time parameter of a rather general…

Let $(M,g,J)$ be a closed K\"ahler manifold with negative sectional curvature and complex dimension $m := \dim_{\mathbb{C}} M \geq 2$. In this article, we study the unitary frame flow, that is, the restriction of the frame flow to the…

Graph pebbling is a network optimization model for satisfying vertex demands with vertex supplies (called pebbles), with partial loss of pebbles in transit. The pebbling number of a demand in a graph is the smallest number for which every…

We perform forward error analysis for a large class of recursive matrix multiplication algorithms in the spirit of [D. Bini and G. Lotti, Stability of fast algorithms for matrix multiplication, Numer. Math. 36 (1980), 63--72]. As a…

Talagrand conjectured that if a family of sets $\mathcal{F}$ over $X = \{ 1,2,\cdots, N \}$ is of large measure, then constant times of unions of sets in $\mathcal{F}$ will cover a large portion of the power set of $X$. This conjecture is a…

We consider a single-server system with service stations in each point of the circle. Customers arrive after exponential times at uniformly-distributed locations. The server moves at finite speed and adopts a greedy routing mechanism. It…

We formulate the theory of the two-stream instability (e-cloud instability) with electrons trapped in quadrupole magnets. We show that a linear instability theory can be sensibly formulated and analyzed. The growth rates are considerably…

The first result is on the separability of the unicast capacity of stationary multi-channel multi-radio wireless networks, i.e., whether the capacity of such a network is equal to the sum of the capacities of the corresponding…

A class of graphs is bridge-addable if given a graph $G$ in the class, any graph obtained by adding an edge between two connected components of $G$ is also in the class. The authors recently proved a conjecture of McDiarmid, Steger, and…