Zobrazeno 1 - 10
of 48
pro vyhledávání: '"Chiniforooshan, Ehsan"'
Let $F_G(P)$ be a functional defined on the set of all the probability distributions on the vertex set of a graph $G$. We say that $G$ is \emph{symmetric with respect to $F_G(P)$} if the uniform distribution on $V(G)$ maximizes $F_G(P)$. Using the co
Externí odkaz:
http://arxiv.org/abs/1510.01415
Autor:
Chiniforooshan, Ehsan Jay
In this thesis, we introduce the intersperse coloring problem, which is a generalized version of the hypergraph coloring problem. In the intersperse coloring problem, we seek a coloring that assigns at least l different colors to each hyperedge of th
Externí odkaz:
http://hdl.handle.net/10012/3331
Autor:
Aboulker, Pierre, Bondy, Adrian, Chen, Xiaomin, Chiniforooshan, Ehsan, Chvátal, Vašek, Miao, Peihan
Publikováno v:
Discrete Applied Mathematics 171 (2014) 137-140
Chen and Chv\'atal introduced the notion of lines in hypergraphs; they proved that every 3-uniform hypergraph with $n$ vertices either has a line that consists of all $n$ vertices or else has at least $\log_2 n$ distinct lines. We improve this lower
Externí odkaz:
http://arxiv.org/abs/1308.5393
Autor:
Beaudou, Laurent, Bondy, Adrian, Chen, Xiaomin, Chiniforooshan, Ehsan, Chudnovsky, Maria, Chvatal, Vasek, Fraiman, Nicolas, Zwols, Yori
Publikováno v:
The Electronic Journal of Combinatorics 22, Issue 1 (2015), Paper #P1.70 (6 pages)
A special case of a combinatorial theorem of De Bruijn and Erdos asserts that every noncollinear set of n points in the plane determines at least n distinct lines. Chen and Chvatal suggested a possible generalization of this assertion in metric space
Externí odkaz:
http://arxiv.org/abs/1201.6376
Autor:
Beaudou, Laurent, Bondy, Adrian, Chen, Xiaomin, Chiniforooshan, Ehsan, Chudnovsky, Maria, Chvatal, Vasek, Fraiman, Nicolas, Zwols, Yori
Publikováno v:
Combinatorica 33 (2013), 633-654
One of the De Bruijn - Erdos theorems deals with finite hypergraphs where every two vertices belong to precisely one hyperedge. It asserts that, except in the perverse case where a single hyperedge equals the whole vertex set, the number of hyperedge
Externí odkaz:
http://arxiv.org/abs/1112.0376
We investigate the role of nondeterminism in Winfree's abstract Tile Assembly Model (aTAM), which was conceived to model artificial molecular self-assembling systems constructed from DNA. Of particular practical importance is to find tile systems tha
Externí odkaz:
http://arxiv.org/abs/1006.2897
We propose a novel theoretical biomolecular design to implement any Boolean circuit using the mechanism of DNA strand displacement. The design is scalable: all species of DNA strands can in principle be mixed and prepared in a single test tube, rathe
Externí odkaz:
http://arxiv.org/abs/1003.3275
Repetition avoidance has been studied since Thue's work. In this paper, we considered another type of repetition, which is called pseudo-power. This concept is inspired by Watson-Crick complementarity in DNA sequence and is defined over an antimorphi
Externí odkaz:
http://arxiv.org/abs/0911.2233
Autor:
Chiniforooshan, Ehsan, Chvátal, Vašek
Publikováno v:
Discrete Mathematics & Theoretical Computer Science Vol 13 No 1 (2011), 67 - 74
De Bruijn and Erd\H{o}s proved that every noncollinear set of n points in the plane determines at least n distinct lines. Chen and Chv\'atal suggested a possible generalization of this theorem in the framework of metric spaces. We provide partial res
Externí odkaz:
http://arxiv.org/abs/0906.0123
Publikováno v:
In Theoretical Computer Science 5 October 2012 454:81-87
