305 research outputs found
The Effect of Planarization on Width
We study the effects of planarization (the construction of a planar diagram
from a non-planar graph by replacing each crossing by a new vertex) on
graph width parameters. We show that for treewidth, pathwidth, branchwidth,
clique-width, and tree-depth there exists a family of -vertex graphs with
bounded parameter value, all of whose planarizations have parameter value
. However, for bandwidth, cutwidth, and carving width, every graph
with bounded parameter value has a planarization of linear size whose parameter
value remains bounded. The same is true for the treewidth, pathwidth, and
branchwidth of graphs of bounded degree.Comment: 15 pages, 6 figures. To appear at the 25th International Symposium on
Graph Drawing and Network Visualization (GD 2017
A Classical Sequential Growth Dynamics for Causal Sets
Starting from certain causality conditions and a discrete form of general
covariance, we derive a very general family of classically stochastic,
sequential growth dynamics for causal sets. The resulting theories provide a
relatively accessible ``half way house'' to full quantum gravity that possibly
contains the latter's classical limit (general relativity). Because they can be
expressed in terms of state models for an assembly of Ising spins living on the
relations of the causal set, these theories also illustrate how
non-gravitational matter can arise dynamically from the causal set without
having to be built in at the fundamental level. Additionally, our results bring
into focus some interpretive issues of importance for causal set dynamics, and
for quantum gravity more generally.Comment: 28 pages, 9 figures, LaTeX, added references and a footnote, minor
correction
Scale Invariance and Nonlinear Patterns of Human Activity
We investigate if known extrinsic and intrinsic factors fully account for the
complex features observed in recordings of human activity as measured from
forearm motion in subjects undergoing their regular daily routine. We
demonstrate that the apparently random forearm motion possesses previously
unrecognized dynamic patterns characterized by fractal and nonlinear dynamics.
These patterns are unaffected by changes in the average activity level, and
persist when the same subjects undergo time-isolation laboratory experiments
designed to account for the circadian phase and to control the known extrinsic
factors. We attribute these patterns to a novel intrinsic multi-scale dynamic
regulation of human activity.Comment: 4 pages, three figure
Small ball probability, Inverse theorems, and applications
Let be a real random variable with mean zero and variance one and
be a multi-set in . The random sum
where are iid copies of
is of fundamental importance in probability and its applications.
We discuss the small ball problem, the aim of which is to estimate the
maximum probability that belongs to a ball with given small radius,
following the discovery made by Littlewood-Offord and Erdos almost 70 years
ago. We will mainly focus on recent developments that characterize the
structure of those sets where the small ball probability is relatively
large. Applications of these results include full solutions or significant
progresses of many open problems in different areas.Comment: 47 page
Visibility Representations of Boxes in 2.5 Dimensions
We initiate the study of 2.5D box visibility representations (2.5D-BR) where
vertices are mapped to 3D boxes having the bottom face in the plane and
edges are unobstructed lines of sight parallel to the - or -axis. We
prove that: Every complete bipartite graph admits a 2.5D-BR; The
complete graph admits a 2.5D-BR if and only if ; Every
graph with pathwidth at most admits a 2.5D-BR, which can be computed in
linear time. We then turn our attention to 2.5D grid box representations
(2.5D-GBR) which are 2.5D-BRs such that the bottom face of every box is a unit
square at integer coordinates. We show that an -vertex graph that admits a
2.5D-GBR has at most edges and this bound is tight. Finally,
we prove that deciding whether a given graph admits a 2.5D-GBR with a given
footprint is NP-complete. The footprint of a 2.5D-BR is the set of
bottom faces of the boxes in .Comment: Appears in the Proceedings of the 24th International Symposium on
Graph Drawing and Network Visualization (GD 2016
A verified algorithm enumerating event structures
An event structure is a mathematical abstraction modeling concepts as causality, conflict and concurrency between events. While many other mathematical structures, including groups, topological spaces, rings, abound with algorithms and formulas to generate, enumerate and count particular sets of their members, no algorithm or formulas are known to generate or count all the possible event structures over af inite set of events. We present an algorithm to generate such a family, along with a functional implementation verified using Isabelle/HOL. As byproducts, we obtain a verified enumeration of all possible preorders and partial orders. While the integer sequences counting preorders and partial orders are already listed on OEIS (On-line Encyclopedia of Integer Sequences), the one counting event structures is not. We therefore used our algorithm to submit a formally verified addition, which has been successfully reviewed and is now part of the OEIS.Postprin
Good Random Matrices over Finite Fields
The random matrix uniformly distributed over the set of all m-by-n matrices
over a finite field plays an important role in many branches of information
theory. In this paper a generalization of this random matrix, called k-good
random matrices, is studied. It is shown that a k-good random m-by-n matrix
with a distribution of minimum support size is uniformly distributed over a
maximum-rank-distance (MRD) code of minimum rank distance min{m,n}-k+1, and
vice versa. Further examples of k-good random matrices are derived from
homogeneous weights on matrix modules. Several applications of k-good random
matrices are given, establishing links with some well-known combinatorial
problems. Finally, the related combinatorial concept of a k-dense set of m-by-n
matrices is studied, identifying such sets as blocking sets with respect to
(m-k)-dimensional flats in a certain m-by-n matrix geometry and determining
their minimum size in special cases.Comment: 25 pages, publishe
Translating promising strategies for bowel and bladder management in spinal cord injury
Loss of control over voiding following spinal cord injury (SCI) impacts autonomy, participation and dignity, and can cause life-threatening complications. The importance of SCI bowel and bladder dysfunction warrants significantly more attention from researchers in the field. To address this gap, key SCI clinicians, researchers, government and private funding organizations met to share knowledge and examine emerging approaches. This report reviews recommendations from this effort to identify and prioritize near-term treatment, investigational and translational approaches to addressing the pressing needs of people with SCI
- …