Datasets:

Asilarkness
/

DiffuRefill-facts


1	+ {"text": "Re Goldcorp Exchange Limited (in receivership): Kensington v Liggett is a leading English decision that clarifies the limits of a receiver’s power to vary or set‑aside contracts entered into by a company before it entered insolvency. The case arose when Goldcorp Exchange Limited, a securities‑trading platform, went into receivership under a debenture held by Kensington Bank. While the receiver, acting under the terms of the debenture, sought to terminate a forward‑sale agreement with Liggett Securities, Liggett argued that the contract could not be repudiated because it was a “pre‑insolvency” contract that the receiver was bound to honour. The Court of Appeal, applying the statutory framework of the Insolvency Act 1986 (IA 1986) and the common‑law principles governing receivers, held that a receiver may, in the ordinary course of business, continue existing contracts, but may also vary or terminate them if doing so is necessary to protect the security holder’s interests, provided the receiver acts within the scope of the appointment and the terms of the debenture.\n\nThe key ideas can be distilled into three propositions. First, a receiver’s authority is defined by the instrument of appointment and by sections 14 and 15 of the IA 1986, which give the receiver the power to “manage” the property of the company and to “sell” it for the benefit of the charge holder. Second, the “ordinary course of business” exception—found in s. 238 of the IA 1986—allows the receiver to continue contracts that were entered into before the appointment only if they are ordinary for the business and do not prejudice the security holder. Third, where a contract is not “ordinary” or is detrimental, the receiver may vary or rescind it, but must give the other party reasonable notice and act in good faith, lest the receiver be liable for breach of contract.\n\nTo illustrate, suppose Goldcorp had a forward‑sale contract to deliver 1,000 shares of Company A to Liggett at a price of £10 per share, signed six months before the appointment. The market price of Company A’s shares has since fallen to £6, and the receiver estimates that selling the shares under the contract would reduce the net proceeds available to Kensington by £4,000. Under Kensington v Liggett, the receiver may serve a notice of termination on Liggett, provided the debenture expressly permits termination of “non‑essential” contracts and the receiver can show that the termination is necessary to preserve the value of the security. The receiver must also consider whether the contract was “ordinary” for Goldcorp’s trading business; if Goldcorp routinely entered forward‑sale agreements, the contract might be deemed ordinary, obliging the receiver to continue it unless the debenture contains a clear power to vary. In this example, assuming the debenture contains a clause allowing termination of contracts that would cause a loss exceeding 5 % of the secured debt, the receiver’s termination is within authority, and Liggett’s claim for breach would fail. The decision thus balances the receiver’s duty to the charge holder against the contractual expectations of third parties, establishing a clear test for when pre‑insolvency contracts may be set aside."}
2	+ {"text": "In the second version of the classic “haunted house’’ problem we consider a finite, discrete system that can be described by a set of states indexed by the natural numbers. Let the house contain \\(n\\) rooms, numbered \\(1,2,\\dots ,n\\). At each integer time step a ghost moves from its current room to an adjacent room; adjacency is defined by a fixed undirected graph \\(G=(V,E)\\) with vertex set \\(V=\\{1,\\dots ,n\\}\\). The movement rule is that from any room \\(i\\) the ghost chooses uniformly at random one of the rooms \\(j\\) for which \\(\\{i,j\\}\\in E\\). The process therefore constitutes a discrete‑time Markov chain \\(\\{X_{t}\\}_{t\\ge 0}\\) on the state space \\(V\\). The transition matrix \\(P=(p_{ij})\\) is given by \n\n\\[\np_{ij}=\\begin{cases}\n\\frac{1}{\\deg(i)} & \\text{if }\\{i,j\\}\\in E,\\\\[4pt]\n0 & \\text{otherwise},\n\\end{cases}\n\\]\n\nwhere \\(\\deg(i)\\) denotes the degree of vertex \\(i\\). Because the graph is finite and each vertex has at least one incident edge, the chain is irreducible and aperiodic; consequently it possesses a unique stationary distribution \\(\\pi\\) satisfying \\(\\pi P=\\pi\\) and \\(\\sum_{i=1}^{n}\\pi_{i}=1\\).\n\nThe haunted‑house question asks for the expected number of distinct rooms visited before the ghost first returns to its starting room, say room \\(1\\). Define the hitting time \\(\\tau=\\min\\{t\\ge 1 : X_{t}=1\\}\\). For each state \\(i\\) let \\(h_{i}=E_{i}[\\tau]\\) denote the expected return time when the chain starts from \\(i\\). Standard Markov‑chain theory gives \\(h_{i}=1/\\pi_{i}\\). Thus the problem reduces to determining \\(\\pi_{1}\\). For a regular graph, where every vertex has the same degree \\(d\\), the stationary distribution is uniform: \\(\\pi_{i}=1/n\\) for all \\(i\\). Consequently the expected return time to the starting room is \\(h_{1}=n\\). In this regular case the expected number of distinct rooms visited before the first return equals the expected return time, because the ghost cannot revisit a room without first leaving it, and each step visits a new room until the return occurs. Hence the expected number of distinct rooms is exactly \\(n\\).\n\nTo illustrate, consider a haunted house with three rooms arranged in a triangle, so \\(n=3\\) and each vertex has degree \\(2\\). The transition matrix is \n\n\\[\nP=\\begin{pmatrix}\n0 & \\tfrac12 & \\tfrac12\\\\[4pt]\n\\tfrac12 & 0 & \\tfrac12\\\\[4pt]\n\\tfrac12 & \\tfrac12 & 0\n\\end{pmatrix}.\n\\]\n\nThe stationary distribution is \\(\\pi=(\\tfrac13,\\tfrac13,\\tfrac13)\\). Starting from room 1, the expected return time is \\(h_{1}=1/\\pi_{1}=3\\). Therefore the ghost, on average, will wander through all three rooms before coming back to the entrance. This concrete computation confirms the general formula for regular haunted houses and demonstrates how natural numbers (the room labels), state numbers (the indices of the Markov chain), and precise definitions combine to yield a rigorous answer."}