Results 51 to 60 of about 145,190 (272)
Internal Phase Separation in Synthetic DNA Condensates
Advanced Science, EarlyView.The modular, programmable system of DNA nanostructures developed provides programmatic control over multiphase condensate behavior, enabling mapping onto a predictive Flory‐Huggins model. This combined experimental and theoretical framework will help address open questions in condensate biophysics and facilitate the rational design of functional ...
Diana A. Tanase +5 more
wiley +1 more source
Rainbow Connection Number of Graphs with Diameter 3
Discussiones Mathematicae Graph Theory, 2017 A path in an edge-colored graph G is rainbow if no two edges of the path are colored the same. The rainbow connection number rc(G) of G is the smallest integer k for which there exists a k-edge-coloring of G such that every pair of distinct vertices of G
Li Hengzhe, Li Xueliang, Sun Yuefang
doaj +1 more source
Distribution of the Number of Encryptions in Revocation Schemes for Stateless Receivers [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 We study the number of encryptions necessary to revoke a set of users in the complete subtree scheme (CST) and the subset-difference scheme (SD). These are well-known tree based broadcast encryption schemes.
Christopher Eagle +4 more
doaj +1 more source
Teaching Combinatorial Principles Using Relations through the Placemat Method
Mathematics, 2021 The presented paper is devoted to an innovative way of teaching mathematics, specifically the subject combinatorics in high schools. This is because combinatorics is closely connected with the beginnings of informatics and several other scientific ...
Viliam Ďuriš +3 more
doaj +1 more source
Hopf Algebras in Combinatorics
, 2020 These notes -- originating from a one-semester class by their second author at the University of Minnesota -- survey some of the most important Hopf algebras appearing in combinatorics.
Grinberg, Darij, Reiner, Victor
core +1 more source
On the Combinatorics of Smoothing [PDF]
Journal of Mathematical Sciences, 2016 Many invariants of knots rely upon smoothing the knot at its crossings. To compute them, it is necessary to know how to count the number of connected components the knot diagram is broken into after the smoothing. In this paper, it is shown how to use a modification of a theorem of Zulli together with a modification of the spectral theory of graphs to ...
openaire +3 more sources
Advanced single‐cell RNA sequencing in tumor immunology
Interdisciplinary Medicine, EarlyView.This review highlights the applications of advanced single‐cell RNA sequencing (scRNA‐seq) technologies in tumor immunology. It summarizes representative scRNA‐seq methods according to technical principles, with a focus on single‐cell T cell receptor sequencing. This review also discusses how scRNA‐seq is used to construct immune cell atlases of tumors,
Yilong Liu +8 more
wiley +1 more source
Kaleidoscopic Edge-Coloring of Complete Graphs and r-Regular Graphs
Discussiones Mathematicae Graph Theory, 2019 For an r-regular graph G, we define an edge-coloring c with colors from {1, 2, . . . , k}, in such a way that any vertex of G is incident with at least one edge of each color. The multiset-color cm(v) of a vertex v is defined as the ordered tuple (a1, a2,
Li Xueliang, Zhu Xiaoyu
doaj +1 more source
Journal of Mathematical Analysis and Applications, 1991 A combinatoric problem is considered concerning the number of ways of throwing \(k\) balls into an array of \(n\times m\) cells in such a way that each row and each column of the cells must contain at least one ball and that each cell can contain at most one ball, where \(k\), \(n\), \(m\) are natural numbers. Let \(^ kB\) denote a set \(B\) with \(k\)
S.K. Tan +3 more
openaire +2 more sources
Commuting Pairs in Quasigroups
Journal of Combinatorial Designs, EarlyView.ABSTRACT A quasigroup is a pair (Q,∗) $(Q,\ast )$, where Q $Q$ is a nonempty set and ∗ $\ast $ is a binary operation on Q $Q$ such that for every (a,b)∈Q2 $(a,b)\in {Q}^{2}$, there exists a unique (x,y)∈Q2 $(x,y)\in {Q}^{2}$ such that a∗x=b=y∗a $a\ast x=b=y\ast a$. Let (Q,∗) $(Q,\ast )$ be a quasigroup. A pair (x,y)∈Q2 $(x,y)\in {Q}^{2}$ is a commuting
Jack Allsop, Ian M. Wanless
wiley +1 more source