Related papers: Enumerating multiplex juggling patterns
In this paper we develop the theory of how to count, in thin concurrent games, the configurations of a strategy witnessing that it reaches a certain configuration of the game. This plays a central role in many recent developments in…
Say you and some friends decide to make brackets for March Madness and are told how each of your brackets scored. The question we ask is: when can you determine how the actual tournament went given your scores? We determine the exact…
A major limitation of exact inference algorithms for probabilistic graphical models is their extensive memory usage, which often puts real-world problems out of their reach. In this paper we show how we can extend inference algorithms,…
Let $N_n=\{1,2,...,n\}$. Elements are drawn from the set $N_n$ with replacement, assuming that each element has probability $1/n$ of being drawn. We determine the limiting distributions for the waiting time until the given portion of pairs…
Graph pebbling considers the problem of transforming configurations of discrete pebbles to certain target configurations on the vertices of a graph, using the so-called pebbling move. This paper provides counterexamples to a monotonicity…
In the domain of Sport Analytics, Global Positioning Systems devices are intensively used as they permit to retrieve players' movements. Team sports' managers and coaches are interested on the relation between players' patterns of movements…
A continuously measured quantum system with multiple jump channels gives rise to a stochastic process described by random jump times and random emitted symbols, representing each jump channel. While much is known about the waiting time…
A notion of combinatorial game over a partially ordered set of atomic outcomes was recently introduced by Selinger. These games are appropriate for describing the value of positions in Hex and other monotone set coloring games. It is…
The thesis consider the mixing of few (3-4) card shuffling as well as of large (52 card) deck. The thesis is showing the limit on the shuffling to homogeneity elaborated in short program; the thesis is in italian.
Clustering is a common technique for statistical data analysis, which is used in many fields, including machine learning, data mining, pattern recognition, image analysis and bioinformatics. Clustering is the process of grouping similar…
Motivated by the enumeration of a class of plane partitions studied by Proctor and by considerations about symmetry classes of plane partitions, we consider the problem of enumerating lozenge tilings of a hexagon with ``maximal staircases''…
A classification of multipartite entanglement in qubit systems is introduced for pure and mixed states. The classification is based on the robustness of the said entanglement against partial trace operation. Then we use current machine…
Clustering is the process of finding underlying group structures in data. Although mixture model-based clustering is firmly established in the multivariate case, there is a relative paucity of work on matrix variate distributions and none…
In this paper, we consider a game beginning with a multiset of elements from a group. On a move, two elements are replaced by their sum. This is a no strategy game, and can be modeled as a graded poset with the rank of a node equal to the…
Clustering is an unsupervised technique of Data Mining. It means grouping similar objects together and separating the dissimilar ones. Each object in the data set is assigned a class label in the clustering process using a distance measure.…
For a topological space $X$ and a point $x \in X$, consider the following game -- related to the property of $X$ being countably tight at $x$. In each inning $n\in\omega$, the first player chooses a set $A_n$ that clusters at $x$, and then…
Based on known methods for computing the number of distinct score sequences for $n$-vertex tournaments, we develop algorithms for computing the number of distinct score sequences for self-complementary tournaments, strong tournaments, and…
Consider an n by n array of cards shuffled in the following manner. An element x of the array is chosen uniformly at random; Then with probability 1/2 the rectangle of cards above and to the left of x is rotated 180 degrees, and with…
Tracking the ball is critical for video-based analysis of team sports. However, it is difficult, especially in low-resolution images, due to the small size of the ball, its speed that creates motion blur, and its often being occluded by…
Pebble games were extensively studied in the 1970s and 1980s in a number of different contexts. The last decade has seen a revival of interest in pebble games coming from the field of proof complexity. Pebbling has proven to be a useful…