Related papers: Region crossing change on origami and link

Social choice becomes easier on restricted preference domains such as single-peaked, single-crossing, and Euclidean preferences. Many impossibility theorems disappear, the structure makes it easier to reason about preferences, and…

This article is concerned with an example of complex planar geometry arising from flat origami challenges. The complexity of solution algorithms is illustrated, depending on the depth of the initial analysis of the problem, starting from…

Serious games can teach essential coding and testing concepts even to younger audiences. In the Code Critter game critters execute short snippets of block-based code while traversing the game map, and players position magical portals (akin…

We consider the problem of deciding, given a sequence of regions, if there is a choice of points, one for each region, such that the induced polyline is simple or weakly simple, meaning that it can touch but not cross itself. Specifically,…

Locally recoverable codes deal with the task of reconstructing a lost symbol by relying on a portion of the remaining coordinates smaller than an information set. We consider the case of codes over finite chain rings, generalizing known…

In this paper, we introduce a graph coloring game called the Edge-Distinguishing Game (EDGe). The edge-distinguishing chromatic number of a graph is used to determine the moves each player can make. We determine which player has a winning…

Non-Euclidean origami is a promising technique for designing multistable deployable structures folded from nonplanar developable surfaces. The impossibility of flat foldability inherent to non-Euclidean origami results in two disconnected…

We introduce a new abstract graph game, Swap Planarity, where the goal is to reach a state without edge intersections and a move consists of swapping the locations of two vertices connected by an edge. We analyze this puzzle game using…

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…

The Algorithm Selection Problem is concerned with selecting the best algorithm to solve a given problem on a case-by-case basis. It has become especially relevant in the last decade, as researchers are increasingly investigating how to…

Origami and kirigami have emerged as potential tools for the design of mechanical metamaterials whose properties such as curvature, Poisson ratio, and existence of metastable states can be tuned using purely geometric criteria. A major…

Expressive range analysis is a visualization-based technique used to evaluate the performance of generative models, particularly in game level generation. It typically employs two quantifiable metrics to position generated artifacts on a 2D…

We introduce STRING: Separable Translationally Invariant Position Encodings. STRING extends Rotary Position Encodings, a recently proposed and widely used algorithm in large language models, via a unifying theoretical framework.…

Structures like galaxies and filaments of galaxies in the Universe come about from the origami-like folding of an initially flat three-dimensional manifold in 6D phase space. The ORIGAMI method identifies these structures in a cosmological…

We propose PermaKey, a novel approach to representation learning based on object keypoints. It leverages the predictability of local image regions from spatial neighborhoods to identify salient regions that correspond to object parts, which…

We show that one can interweave an unknot into any non-alternating connected projection of a link so that the resulting augmented projection is alternating.

This article describes a new system for induction of oblique decision trees. This system, OC1, combines deterministic hill-climbing with two forms of randomization to find a good oblique split (in the form of a hyperplane) at each node of a…

Motivated by recent computational models for redistricting and detection of gerrymandering, we study the following problem on graph partitions. Given a graph $G$ and an integer $k\geq 1$, a $k$-district map of $G$ is a partition of $V(G)$…

We describe PNim and RNim, two variants of Nim in which piles of tokens are replaced with integer partitions or hyperrectangles. In PNim, the players choose one of the integer partitions and remove a positive number of rows or a positive…

Motivated by the problem of redistricting, we study area-preserving reconfigurations of connected subdivisions of a simple polygon. A connected subdivision of a polygon $\mathcal{R}$, called a district map, is a set of interior disjoint…