Results 1 to 10 of about 424,178 (243)
Unity-resolving states and generalised Golden-Thompson bounds on partition functions
It is shown that certain sets of normalised unity-resolving (e.g. coherent) states in Hilbert space serve to generate upper bounds on the partition function of a given Hamiltonian in that space.
Leschke, Hajo +5 more
core +2 more sources
Connected partition dimensions of graphs [PDF]
For a vertex v of a connected graph G and a subset S of V(G), the distance between v and S is d(v,S) = min{d(v,x)|x ∈ S}. For an ordered k-partition Π = {S₁,S₂,...,Sₖ} of V(G), the representation of v with respect to Π is the k-vector r(v|Π) = (d(v,S₁ ...
Saenpholphat, Varaporn, Zhang, Ping
core +1 more source
Debating partition : justifications and critiques [PDF]
Revised version of portion of a paper presented at final conference of the Mapping frontiers, plotting pathways: routes to North-South cooperation in a divided island programme, City Hotel, Armagh, 19-20 January 2006Political partitions—fresh political
O'Leary, Brendan
core +1 more source
Flyer "Monster Anti-Partition Demonstration" [PDF]
Flyer for "Monster Anti-Partition Demonstration" in Glasgow, issued by the Council of Irish Societies, Glasgow.
Anti-Partition League, APL +1 more
core +3 more sources
GENERALIZATION OF PARTITION FUNCTION, INTRODUCING SMARANDACHE FACTOR PARTITION [PDF]
Partition function P(n) is defined as the number of ways that a positive integer can be expressed as the sum of positive integers.
Murthy, Amarnath
core +1 more source
The Knowlton-Graham partition problem [PDF]
A set partition technique that is useful for identifying wires in cables can be recast in the language of 0–1 matrices, thereby resolving an open problem stated by R. L. Graham in Volume 1 of this journal.
Donald E. Knuth, Knuth, Donald E.
core +1 more source
The Core of a Partition Function Game [PDF]
We consider partition function games and introduce new defini-tions of the core that include the effects of externalities. We assume that all players behave rationally and that all stable outcomes arising are consistent with the appropriate generalised ...
László Á. Kóczy
core +2 more sources
Partition dimension of disjoint union of complete bipartite graphs
For any (not necessary connected) graph $G(V,E)$ and $A\subseteq V(G)$, the distance of a vertex $x\in V(G)$ and $A$ is $d(x,A)=\min\{d(x,a): a\in A\}$. A subset of vertices $A$ resolves two vertices $x,y \in V(G)$ if $d(x,A)\neq d(y,A)$.
Haryeni, Debi Oktia +2 more
core +1 more source
Sharp bounds for partition dimension of generalized Möbius ladders
The concept of minimal resolving partition and resolving set plays a pivotal role in diverse areas such as robot navigation, networking, optimization, mastermind games and coin weighing.
Hussain Zafar +14 more
core +1 more source

