Related papers: Picture-Hanging Puzzles
Given a complete graph with positive weights on its edges, we define the weight of a subset of edges as the product of weights of the edges in the subset and consider sums (partition functions) of weights over subsets of various kinds:…
When a weak photon decay competes with a strong photon decay in a 3-level atom, the weak occasionally prevails over the strong photon. This is the shelving phenomenon. It is assumed in this paper to occur objectively and autonomously,…
In a probabilistic model of a film over a disordered substrate, Monte-Carlo simulations show that the film hangs from peaks of the substrate. The film profile is well approximated by a necklace of Wulff shapes. Such a necklace can be…
Firstly, for a general graph, we find a recursion formula on the number of Hamiltonian cycles and one on cycles. By this result, we give some new polynomial invariants. Secondly, we give a condition to tell whether a polynomial defined by…
In the game of pegging, each vertex of a graph is considered a hole into which a peg can be placed. A pegging move is performed by jumping one peg over another peg, and then removing the peg that has been jumped over from the graph. We…
A folded chain, with one end fixed at the ceiling and the other end released from the same elevation, is commonly modeled as an energy-conserving system in one-dimension. However, the analytical paradigms in previous literature is…
We propose a representation of boolean bent functions by bent rectangles, that is, by special matrices with restrictions on rows and columns. Using this representation, we exhibit new classes of bent functions, give an algorithm to…
In this work, we explore a genre of puzzles ("image riddles") which involves a set of images and a question. Answering these puzzles require both capabilities involving visual detection (including object, activity recognition) and,…
Given two independent sets $I, J$ of a graph $G$, and imagine that a token (coin) is placed at each vertex of $I$. The Sliding Token problem asks if one could transform $I$ to $J$ via a sequence of elementary steps, where each step requires…
The act of measuring optical emissions from two remote qubits can entangle them. By demanding that a photon from each qubit reaches the detectors, one can ensure than no photon was lost. But the failure rate then rises quadratically with…
When a lump of matter falls into a black hole it is expected that a marginally trapped tube when hit moves outwards everywhere, even in regions not yet in causal contact with the infalling matter. But to describe this phenomenon…
We study dismantlability in graphs. In order to compare this notion to similar operations in posets (partially ordered sets) or in simplicial complexes, we prove that a graph G dismants on a subgraph H if and only if H is a strong…
The class P is in fact a proper sub-class of NP. We explore topological properties of the Hamming space 2^[n] where [n]={1, 2,..., n}. With the developed theory, we show: (i) a theorem that is closely related to Erdos and Rado's sunflower…
Consider the fundamental problem of drawing a simple random sample of size k without replacement from [n] := {1, . . . , n}. Although a number of classical algorithms exist for this problem, we construct algorithms that are even simpler,…
In the present paper, we consider two applications of the pentagon equation. The first deals with actions of flips on edges of triangulations labelled by rational functions in some variables. The second can be formulated as a system of…
We introduce a new family of one-player games, involving the movement of coins from one configuration to another. Moves are restricted so that a coin can be placed only in a position that is adjacent to at least two other coins. The goal of…
It has been suggested recently that knots might exist as stable soliton solutions in a simple three-dimensional classical field theory, opening up a wide range of possible applications in physics and beyond. We have re-examined and extended…
Knots are entangled structures that cannot be untangled without a cut. Topological stability of knots is one of the many examples of their important properties that can be used in information storage and transfer. Knot dynamics is important…
A function on a topological space is called unimodal if all of its super-level sets are contractible. A minimal unimodal decomposition of a function $f$ is the smallest number of unimodal functions that sum up to $f$. The problem of…
In classical physics, calculating the slack of a hanging chain is a problem that has attracted interest. This study aims to solve this problem through experiment and theory. When the length and distance of both the ends of a hanging chain…