Zobrazeno 1 - 10
of 119
pro vyhledávání: '"Prasad Tetali"'
Publikováno v:
Mathematical and Computational Applications, Vol 25, Iss 4, p 67 (2020)
Ribonucleic acid (RNA) secondary structures and branching properties are important for determining functional ramifications in biology. While energy minimization of the Nearest Neighbor Thermodynamic Model (NNTM) is commonly used to identify such pro
Externí odkaz:
https://doaj.org/article/79a62d9d9315400a871f5aaa06d7c347
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AQ,..., Iss Proceedings (2012)
Given a planar triangulation, a 3-orientation is an orientation of the internal edges so all internal vertices have out-degree three. Each 3-orientation gives rise to a unique edge coloring known as a $\textit{Schnyder wood}$ that has proven useful f
Externí odkaz:
https://doaj.org/article/580b68f7540c4e668282081ffaafd399
Autor:
Christine E. Heitsch, Prasad Tetali
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AO,..., Iss Proceedings (2011)
We consider a Markov chain Monte Carlo approach to the uniform sampling of meanders. Combinatorially, a meander $M = [A:B]$ is formed by two noncrossing perfect matchings, above $A$ and below $B$ the same endpoints, which form a single closed loop. W
Externí odkaz:
https://doaj.org/article/fd7eee7f0ea04f1180d1243aa6fb9ce6
Publikováno v:
SIAM Journal on Computing. 52:327-357
Publikováno v:
Random Structures & Algorithms.
Publikováno v:
ANNALI SCUOLA NORMALE SUPERIORE - CLASSE DI SCIENZE. :1207-1232
We give a transport proof of a discrete version of the displacement convexity of entropy on integers (Z), and get, as a consequence, two discrete forms of the Prekopa-Leindler Inequality : the Four Functions Theorem of Ahlswede and Daykin on the disc
Publikováno v:
Combinatorial Theory. 2
Recall that an excedance of a permutation $��$ is any position $i$ such that $��_i > i$. Inspired by the work of Hopkins, McConville and Propp (Elec. J. Comb., 2017) on sorting using toppling, we say that a permutation is toppleable if it get
Determinant maximization problem gives a general framework that models problems arising in as diverse fields as statistics \cite{pukelsheim2006optimal}, convex geometry \cite{Khachiyan1996}, fair allocations\linebreak \cite{anari2016nash}, combinator
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::57a5b6b1caa5d81e0aa8ef47d3044163
Publikováno v:
European Journal of Combinatorics. 102:103481
Let $G$ be a finite, undirected $d$-regular graph and $A(G)$ its normalized adjacency matrix, with eigenvalues $1 = \lambda_1(A)\geq \dots \ge \lambda_n \ge -1$. It is a classical fact that $\lambda_n = -1$ if and only if $G$ is bipartite. Our main r