Results 71 to 80 of about 6,072 (265)

Generalized $$\beta $$ β and (q, t)-deformed partition functions with W-representations and Nekrasov partition functions

open access: yesEuropean Physical Journal C: Particles and Fields
We construct the generalized $$\beta $$ β and (q, t)-deformed partition functions through W representations, where the expansions are respectively with respect to the generalized Jack and Macdonald polynomials labeled by N-tuple of Young diagrams.
Fan Liu   +3 more
doaj   +1 more source

Cubic Graphs with Total Domatic Number at Least Two

open access: yesDiscussiones Mathematicae Graph Theory, 2018
Let G be a graph with no isolated vertex. A total dominating set of G is a set S of vertices of G such that every vertex is adjacent to at least one vertex in S.
Akbari Saieed   +3 more
doaj   +1 more source

Boosting Vertex-Cut Partitioning for Streaming Graphs

open access: yes2016 IEEE International Congress on Big Data (BigData Congress), 2016
While the algorithms for streaming graph partitioning are proved promising, they fall short of creating timely partitions when applied on large graphs. For example, it takes 415 seconds for a state-of-the-art partitioner to work on a social network graph with 117 millions edges.
Hooman Peiro Sajjad   +4 more
openaire   +3 more sources

Hybrid Amyloid–Boron Nitride Aerogels for Lightweight Sound Insulation

open access: yesAdvanced Materials, EarlyView.
Amyloid fibrils template the mild formation of boron nitride–rich hybrid aerogels with hierarchical porosity, enhanced BN‐like ordering, and fibril‐reinforced mechanics. These ultralight materials combine thermal stability with strong sound absorption and transmission loss, offering a sustainable bio‐assisted route toward lightweight acoustic shields ...
Mohammad Peydayesh   +8 more
wiley   +1 more source

O-vertex, O7 + -plane, and topological vertex

open access: yesJournal of High Energy Physics
We revisit the instanton partition function for 5d N $$ \mathcal{N} $$ = 1 SO(N) gauge theories compactified on S1, computed from the topological vertex formalism with the O-vertex based on a 5-brane web diagram with an O5-plane. We introduce an identity
Sung-Soo Kim   +3 more
doaj   +1 more source

Cutwidth Bounds via Vertex Partitions

open access: yesCoRR
14 pages including appendix.
Antoine Amarilli, Benoît Groz
openaire   +2 more sources

Photo‐ and Thermally‐Induced Huge Layer Decoupling in Twisted Bilayer WSe2

open access: yesAdvanced Materials, EarlyView.
A newly developed automated dark‐field tomography visualizes twist‐angle‐dependent structural relaxation and quantifies 3D structures in twisted bilayer WSe2. This approach reveals the evolution of local stacking configurations, thermally induced sub‐ångström interlayer decoupling, and light‐driven interlayer expansion on picosecond timescales ...
A. Nakamura   +10 more
wiley   +1 more source

A note on vertex partitions

open access: yes, 2011
We prove a general lemma about partitioning the vertex set of a graph into subgraphs of bounded degree. This lemma extends a sequence of results of Lovász, Catlin, Kostochka and Rabern.
openaire   +2 more sources

Reversible Hydration Tuning of Polar Order and Large Nonlinear Optical Response in a 2D van der Waals Crystal, LiInP2S6

open access: yesAdvanced Materials, EarlyView.
Hydration‐induced symmetry breaking transforms layered LiInP2S6${\rm LiInP}_2{\rm S}_6$ from a nonpolar to a chiral‐polar phase, producing a giant enhancement of non‐resonant second‐harmonic generation. The reversible tuning of polar order through molecular intercalation establishes a strategy for dynamically controlling nonlinear optical ...
Jadupati Nag   +8 more
wiley   +1 more source

On Subgraphs Induced by Transversals in Vertex-Partitions of Graphs [PDF]

open access: yesThe Electronic Journal of Combinatorics, 2006
For a fixed graph $H$ on $k$ vertices, we investigate the graphs, $G$, such that for any partition of the vertices of $G$ into $k$ color classes, there is a transversal of that partition inducing $H$. For every integer $k\geq 1$, we find a family ${\cal F}$ of at most six graphs on $k$ vertices such that the following holds.
openaire   +2 more sources

Home - About - Disclaimer - Privacy