相关论文: A Gale-Berlekamp permutation-switching problem in …

One-dimensional nonrelativistic systems are studied when time-independent potential interactions are involved. Their supersymmetries are determined and their closed subsets generating kinematical invariance Lie superalgebras are pointed…

The input to the token swapping problem is a graph with vertices $v_1, v_2, \ldots, v_n$, and $n$ tokens with labels $1, 2, \ldots, n$, one on each vertex. The goal is to get token $i$ to vertex $v_i$ for all $i= 1, \ldots, n$ using a…

We describe a percolation problem on lattices (graphs, networks), with edge weights drawn from disorder distributions that allow for weights (or distances) of either sign, i.e. including negative weights. We are interested whether there are…

In this paper we present a novel generic mapping between Graphical Games and Markov Random Fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Thus, the problem of deciding whether a…

We study two models of the Majority problem. We are given n balls and an unknown coloring of them with two colors. We can ask sets of balls of size k as queries, and in the so-called General Model the answer to a query shows if all the…

We consider the transmission problem for the Laplace equation on an infinite three-dimensional wedge, determining the complex parameters for which the problem is well-posed, and characterizing the infinite multiplicity nature of the…

In theories with anomalous fermion number nonconservation, the level crossing picture is considered a faithful representation of the fermionic quantum number variation. It represents each created fermion by an energy level that crosses the…

In this paper, we study the problem of the distributed Nash equilibrium seeking of N-player games over jointly strongly connected switching networks. The action of each player is governed by a class of uncertain nonlinear systems. Our…

An anomalous light shift in the precession of a ground-state Zeeman coherence is observed: the Larmor frequency increases with the strength of a drive that is blue (red) detuned from a transition out of the lower (upper) energy level. Our…

This paper introduces a variant of the classical edge coloring problem in graphs that can be applied to an offline scheduling problem for crossbar switches. We show that the problem is NP-complete, develop three lower bounds bounds on the…

The theory of Gaussian quantum fluctuations around classical steady states in nonlinear quantum-optical systems (also known as standard linearization) is a cornerstone for the analysis of such systems. Its simplicity, together with its…

The aim of this paper is to solve the "gift exchange" problem: you are one of n players, and there are n wrapped gifts on display; when your turn comes, you can either choose any of the remaining wrapped gifts, or you can "steal" a gift…

A mixed graph is a set of vertices together with an edge set and an arc set. An $(m,n)$-mixed graph $G$ is a mixed graph whose edges are each assigned one of $m$ colours, and whose arcs are each assigned one of $n$ colours. A \emph{switch}…

Sampling permutations from S_n is a fundamental problem from probability theory. The nearest neighbor transposition chain \cal{M}}_{nn} is known to converge in time \Theta(n^3 \log n) in the uniform case and time \Theta(n^2) in the constant…

Lights out is a game that can be played on any simple graph $G$. A configuration assigns one of the two states \emph{on} or \emph{off} to each vertex. For a given configuration, the aim of the game is to turn all vertices \emph{off} by…

We consider n non-intersecting Brownian motion paths with p prescribed starting positions at time t=0 and q prescribed ending positions at time t=1. The positions of the paths at any intermediate time are a determinantal point process,…

Signaling game problems investigate communication scenarios where encoder(s) and decoder(s) have misaligned objectives due to the fact that they either employ different cost functions or have inconsistent priors. This problem has been…

We consider a randomized algorithm for the unique games problem, using independent multinomial probabilities to assign labels to the vertices of a graph. The expected value of the solution obtained by the algorithm is expressed as a…

Normally a chess problem must have a unique solution, and is deemed unsound even if there are alternatives that differ only in the order in which the same moves are played. In an enumerative chess problem, the set of moves in the solution…

Schmidt's game is a powerful tool for studying properties of certain sets which arise in Diophantine approximation theory, number theory, and dynamics. Recently, many new results have been proven using this game. In this paper we address…