Results 21 to 30 of about 143,013 (228)

Internal Phase Separation in Synthetic DNA Condensates

open access: yesAdvanced 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

Computational Design of PtM (M = Au, Ir, Pd, Rh, and Ru) Binary Alloys for Enhanced Ammonia Oxidation Electrocatalysis

open access: yesChemElectroChem, EarlyView.
Herein, it is demonstrated that alloying platinum with various transition metals can reduce the limiting potential for the ammonia oxidation reaction, with mixed alloys exhibiting more favorable potentials than their uniform counterparts. By applying the d‐band model to the potential‐limiting step of different Pt─M alloy configurations, a linear ...
Brendan J. R. Laframboise   +3 more
wiley   +1 more source

On the Combinatorics of Smoothing [PDF]

open access: yesJournal 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

Dimer models and conformal structures

open access: yesCommunications on Pure and Applied Mathematics, EarlyView.
Abstract Dimer models have been the focus of intense research efforts over the last years. Our paper grew out of an effort to develop new methods to study minimizers or the asymptotic height functions of general dimer models and the geometry of their frozen boundaries.
Kari Astala   +3 more
wiley   +1 more source

A combinatoric formula

open access: yesJournal 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

Completing Partial k $k$ ‐Star Designs

open access: yesJournal of Combinatorial Designs, EarlyView.
ABSTRACT A k $k$ ‐star is a complete bipartite graph K 1 , k ${K}_{1,k}$ . A partial k $k$ ‐star design of order n $n$ is a pair ( V , A ) $(V,{\mathscr{A}})$ where V $V$ is a set of n $n$ vertices and A ${\mathscr{A}}$ is a set of edge‐disjoint k $k$ ‐stars whose vertex sets are subsets of V $V$ .
Ajani De Vas Gunasekara, Daniel Horsley
wiley   +1 more source

The roots of combinatorics

open access: yesHistoria Mathematica, 1979
AbstractCombinatorics has been rather neglected by historians of mathematics. Yet there are good reasons for studying the origins of the subject, since it is a kind of mathematical subculture, not exactly parallel in its development with the great disciplines of arithmetic, algebra, and geometry.
openaire   +3 more sources

Steiner Triple Systems With High Discrepancy

open access: yesJournal of Combinatorial Designs, EarlyView.
ABSTRACT In this paper, we initiate the study of discrepancy questions for combinatorial designs. Specifically, we show that, for every fixed r ≥ 3 $r\ge 3$ and n ≡ 1 , 3 ( mod 6 ) $n\equiv 1,3\,(\mathrm{mod}\,6)$, any r $r$‐colouring of the triples on [ n ] $[n]$ admits a Steiner triple system of order n $n$ with discrepancy Ω ( n 2 ) ${\rm{\Omega }}({
Lior Gishboliner   +2 more
wiley   +1 more source

Maximum Shattering

open access: yesJournal of Combinatorial Designs, EarlyView.
ABSTRACT A family ℱ ${\rm{ {\mathcal F} }}$ of subsets of [ n ] = { 1 , 2 , … , n } $[n]=\{1,2,\ldots ,n\}$ shatters a set A ⊆ [ n ] $A\subseteq [n]$ if for every A ′ ⊆ A ${A}^{^{\prime} }\subseteq A$, there is an F ∈ ℱ $F\in {\rm{ {\mathcal F} }}$ such that F ∩ A = A ' $F\cap A={A}^{\text{'}}$.
Noga Alon   +2 more
wiley   +1 more source

Combinatorics and Physics [PDF]

open access: yes, 2011
Item does not contain ...
Ebrahimi-Fard, K.   +2 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy