Algebraic characterization of rainbow connectivity

The use of algebraic techniques to solve combinatorial problems is studied in this paper. We formulate the rainbow connectivity problem as a system of polynomial equations. We first consider the case of two colors for which the problem is known to be hard and we then extend the approach to the general case. We also present a formulation of the rainbow connectivity problem as an ideal membership problem.

ON POLYTOPAL UPPER BOUND SPHERES

Generalizing a result (the case k = 1) due to M. A. Perles, we show that any polytopal upper bound sphere of odd dimension 2k + 1 belongs to the generalized Walkup class K-k(2k + 1), i.e., all its vertex links are k-stacked spheres. This is surprising since it is far from obvious that the vertex links of polytopal upper bound spheres should have any special combinatorial structure. It has been conjectured that for d not equal 2k + 1, all (k + 1)-neighborly members of the class K-k(d) are tight. The result of this paper shows that the hypothesis d not equal 2k + 1 is essential for every value of k >= 1.

RES-TOCSY: a simple approach to resolve overlapped H-1 NMR spectra of enantiomers

Chiral auxiliaries are used for the NMR spectroscopic study of enantiomers. Often the presence of impurities, overlap of peaks, line broadening and the multiplicity pattern restrict the chiral analysis in the 1D H-1 NMR spectrum. The present study introduces a simple 2D H-1 NMR experiment to unravel the overlapped spectrum. The experiment separates the spectra of enantiomers, thereby allowing the unambiguous assignment of all the coupled peaks and the measurement of enantiomeric excess (ee) from a single experiment even in combinatorial mixtures.

On 2-D Non-Adjacent-Error Channel Models

In this work, we consider two-dimensional (2-D) binary channels in which the 2-D error patterns are constrained so that errors cannot occur in adjacent horizontal or vertical positions. We consider probabilistic and combinatorial models for such channels. A probabilistic model is obtained from a 2-D random field defined by Roth, Siegel and Wolf (2001). Based on the conjectured ergodicity of this random field, we obtain an expression for the capacity of the 2-D non-adjacent-errors channel. We also derive an upper bound for the asymptotic coding rate in the combinatorial model.

Cooperative Communication of UAV to Perform Multi-task Using Nature Inspired Techniques

In this paper, the approach for assigning cooperative communication of Uninhabited Aerial Vehicles (UAV) to perform multiple tasks on multiple targets is posed as a combinatorial optimization problem. The multiple task such as classification, attack and verification of target using UAV is employed using nature inspired techniques such as Artificial Immune System (AIS), Particle Swarm Optimization (PSO) and Virtual Bee Algorithm (VBA). The nature inspired techniques have an advantage over classical combinatorial optimization methods like prohibitive computational complexity to solve this NP-hard problem. Using the algorithms we find the best sequence in which to attack and destroy the targets while minimizing the total distance traveled or the maximum distance traveled by an UAV. The performance analysis of the UAV to classify, attack and verify the target is evaluated using AIS, PSO and VBA.

Homeostasis of functional maps in active dendrites emerges in the absence of individual channelostasis

The maintenance of ion channel homeostasis, or channelostasis, is a complex puzzle in neurons with extensive dendritic arborization, encompassing a combinatorial diversity of proteins that encode these channels and their auxiliary subunits, their localization profiles, and associated signaling machinery. Despite this, neurons exhibit amazingly stereotypic, topographically continuous maps of several functional properties along their active dendritic arbor. Here, we asked whether the membrane composition of neurons, at the level of individual ion channels, is constrained by this structural requirement of sustaining several functional maps along the same topograph. We performed global sensitivity analysis on morphologically realistic conductance-based models of hippocampal pyramidal neurons that coexpressed six well-characterized functional maps along their trunk. We generated randomized models by varying 32 underlying parameters and constrained these models with quantitative experimental measurements from the soma and dendrites of hippocampal pyramidal neurons. Analyzing valid models that satisfied experimental constraints on all six functional maps, we found topographically analogous functional maps to emerge from disparate model parameters with weak pairwise correlations between parameters. Finally, we derived a methodology to assess the contribution of individual channel conductances to the various functional measurements, using virtual knockout simulations on the valid model population. We found that the virtual knockout of individual channels resulted in variable, measurement and location-specific impacts across the population. Our results suggest collective channelostasis as a mechanism behind the robust emergence of analogous functional maps and have significant ramifications for the localization and targeting of ion channels and enzymes that regulate neural coding and homeostasis.

Evaluating FuncSION: A software for automated synthesis of design solutions for stimulating ideation during mechanical conceptual design

The goal of the work reported in this paper is to use automated, combinatorial synthesis to generate alternative solutions to be used as stimuli by designers for ideation. FuncSION, a computational synthesis tool that can automatically synthesize solution concepts for mechanical devices by combining building blocks from a library, is used for this purpose. The objectives of FuncSION are to help generate a variety of functional requirements for a given problem and a variety of concepts to fulfill these functions. A distinctive feature of FuncSION is its focus on automated generation of spatial configurations, an aspect rarely addressed by other computational synthesis programs. This paper provides an overview of FuncSION in terms of representation of design problems, representation of building blocks, and rules with which building blocks are combined to generate concepts at three levels of abstraction: topological, spatial, and physical. The paper then provides a detailed account of evaluating FuncSION for its effectiveness in providing stimuli for enhanced ideation.

Upper Bounds on the Size of Grain-Correcting Codes

In this paper, we revisit the combinatorial error model of Mazumdar et al. that models errors in high-density magnetic recording caused by lack of knowledge of grain boundaries in the recording medium. We present new upper bounds on the cardinality/rate of binary block codes that correct errors within this model. All our bounds, except for one, are obtained using combinatorial arguments based on hypergraph fractional coverings. The exception is a bound derived via an information-theoretic argument. Our bounds significantly improve upon existing bounds from the prior literature.

BELIEF PROPAGATION FOR OPTIMAL EDGE COVER IN THE RANDOM COMPLETE GRAPH

We apply the objective method of Aldous to the problem of finding the minimum-cost edge cover of the complete graph with random independent and identically distributed edge costs. The limit, as the number of vertices goes to infinity, of the expected minimum cost for this problem is known via a combinatorial approach of Hessler and Wastlund. We provide a proof of this result using the machinery of the objective method and local weak convergence, which was used to prove the (2) limit of the random assignment problem. A proof via the objective method is useful because it provides us with more information on the nature of the edge's incident on a typical root in the minimum-cost edge cover. We further show that a belief propagation algorithm converges asymptotically to the optimal solution. This can be applied in a computational linguistics problem of semantic projection. The belief propagation algorithm yields a near optimal solution with lesser complexity than the known best algorithms designed for optimality in worst-case settings.

Coordinate Hyperactivation of Notch1 and Ras/MAPK Pathways Correlates with Poor Patient Survival: Novel Therapeutic Strategy for Aggressive Breast Cancers

Aberrant activation of Notch and Ras pathways has been detected in breast cancers. A synergy between these two pathways has also been shown in breast cell transformation in culture. Yet, the clinical relevance of Notch-Ras cooperation in breast cancer progression remains unexplored. In this study, we show that coordinate hyperactivation of Notch1 and Ras/MAPK pathways in breast cancer patient specimens, as assessed by IHC for cleaved Notch1 and pErk1/2, respectively, correlated with early relapse to vital organs and poor overall survival. Interestingly, majority of such Notch1 (high)Erk(high) cases encompassed the highly aggressive triple-negative breast cancers (TNBC), and were enriched in stem cell markers. We further show that combinatorial inhibition of Notch1 and Ras/MAPK pathways, using a novel mAb against Notch1 and a MEK inhibitor, respectively, led to a significant reduction in proliferation and survival of breast cancer cells compared with individual inhibition. Combined inhibition also abrogated sphere-forming potential, and depleted the putative cancer stem-like cell subpopulation. Most importantly, combinatorial inhibition of Notch1 and Ras/MAPK pathways completely blocked tumor growth in a panel of breast cancer xenografts, including the TNBCs. Thus, our study identifies coordinate hyperactivation of Notch1 and Ras/MAPK pathways as novel biomarkers for poor breast cancer outcome. Furthermore, based on our preclinical data, we propose combinatorial targeting of these two pathways as a treatment strategy for highly aggressive breast cancers, particularly the TNBCs that currently lack any targeted therapeutic module. (C) 2014 AACR.

Structure-specific nuclease activity of RAGs is modulated by sequence, length and phase position of flanking double-stranded DNA

RAGs (recombination activating genes) are responsible for the generation of antigen receptor diversity through the process of combinatorial joining of different V (variable), D (diversity) and J (joining) gene segments. In addition to its physiological property, wherein RAG functions as a sequence-specific nuclease, it can also act as a structure-specific nuclease leading to genomic instability and cancer. In the present study, we investigate the factors that regulate RAG cleavage on non-B DNA structures. We find that RAG binding and cleavage on heteroduplex DNA is dependent on the length of the double-stranded flanking region. Besides, the immediate flanking double-stranded region regulates RAG activity in a sequence-dependent manner. Interestingly, the cleavage efficiency of RAGs at the heteroduplex region is influenced by the phasing of DNA. Thus, our results suggest that sequence, length and phase positions of the DNA can affect the efficiency of RAG cleavage when it acts as a structure-specific nuclease. These findings provide novel insights on the regulation of the pathological functions of RAGs.

Belief propagation for minimum weight many-to-one matchings in the random complete graph

In a complete bipartite graph with vertex sets of cardinalities n and n', assign random weights from exponential distribution with mean 1, independently to each edge. We show that, as n -> infinity, with n' = n/alpha] for any fixed alpha > 1, the minimum weight of many-to-one matchings converges to a constant (depending on alpha). Many-to-one matching arises as an optimization step in an algorithm for genome sequencing and as a measure of distance between finite sets. We prove that a belief propagation (BP) algorithm converges asymptotically to the optimal solution. We use the objective method of Aldous to prove our results. We build on previous works on minimum weight matching and minimum weight edge cover problems to extend the objective method and to further the applicability of belief propagation to random combinatorial optimization problems.

On Locally Gabriel Geometric Graphs

Let be a set of points in the plane. A geometric graph on is said to be locally Gabriel if for every edge in , the Euclidean disk with the segment joining and as diameter does not contain any points of that are neighbors of or in . A locally Gabriel graph(LGG) is a generalization of Gabriel graph and is motivated by applications in wireless networks. Unlike a Gabriel graph, there is no unique LGG on a given point set since no edge in a LGG is necessarily included or excluded. Thus the edge set of the graph can be customized to optimize certain network parameters depending on the application. The unit distance graph(UDG), introduced by Erdos, is also a LGG. In this paper, we show the following combinatorial bounds on edge complexity and independent sets of LGG: (i) For any , there exists LGG with edges. This improves upon the previous best bound of . (ii) For various subclasses of convex point sets, we show tight linear bounds on the maximum edge complexity of LGG. (iii) For any LGG on any point set, there exists an independent set of size .

Separation index of graphs and stacked 2-spheres

In 1987, Kalai proved that stacked spheres of dimension d >= 3 are characterised by the fact that they attain equality in Barnette's celebrated Lower Bound Theorem. This result does not extend to dimension d = 2. In this article, we give a characterisation of stacked 2-spheres using what we call the separation index. Namely, we show that the separation index of a triangulated 2-sphere is maximal if and only if it is stacked. In addition, we prove that, amongst all n-vertex triangulated 2-spheres, the separation index is minimised by some n-vertex flag sphere for n >= 6. Furthermore, we apply this characterisation of stacked 2-spheres to settle the outstanding 3-dimensional case of the Lutz-Sulanke-Swartz conjecture that ``tight-neighbourly triangulated manifolds are tight''. For dimension d >= 4, the conjecture has already been proved by Effenberger following a result of Novik and Swartz. (C) 2015 Elsevier Inc. All rights reserved.

epsilon-expansions near three dimensions from conformal field theory

We formally extend the CFT techniques introduced in arXiv: 1505.00963, to phi(2d0/d0-2) theory in d = d(0) dimensions and use it to compute anomalous dimensions near d(0) = 3, 4 in a unified manner. We also do a similar analysis of the O(N) model in three dimensions by developing a recursive combinatorial approach for OPE contractions. Our results match precisely with low loop perturbative computations. Finally, using 3-point correlators in the CFT, we comment on why the phi(3) theory in d(0) = 6 is qualitatively different.