Related papers: A Cycle Joining Construction of the Prefer-Max De …

We construct a new process using a fractional Brownian motion and a fractional Ornstein-Uhlenbeck process of the Second Kind as building blocks. We consider the increments of the new process in discrete time and, as a result, we obtain a…

We extend answer set semantics to deal with inconsistent programs (containing classical negation), by finding a ``best'' answer set. Within the context of inconsistent programs, it is natural to have a partial order on rules, representing a…

We prove a descent theorem of nearby cycle formula for Newton non-degenerate functions at the origin as well as its motivic version (without assuming the convenience condition). This is used in some papers without any proof although its…

We consider linear orders of finite alternatives constructed by aggregating individual preferences. Specifically, we focus on linear orders that respect modified collective preference relations derived from supermajority rules, where…

An orientable sequence of order $n$ over an alphabet $\{0,1,\ldots, k{-}1\}$ is a cyclic sequence such that each length-$n$ substring appears at most once \emph{in either direction}. When $k= 2$, efficient algorithms are known to construct…

Universal cycles are generalizations of de Bruijn cycles and Gray codes that were introduced originally by Chung, Diaconis, and Graham in 1990. They have been developed by many authors since, for various combinatorial objects such as…

Transitive closure logic is a known extension of first-order logic obtained by introducing a transitive closure operator. While other extensions of first-order logic with inductive definitions are a priori parametrized by a set of inductive…

A De Bruijn cycle is a cyclic sequence in which every word of length $n$ over an alphabet $\mathcal{A}$ appears exactly once. De Bruijn tori are a two-dimensional analogue. Motivated by recent progress on universal partial cycles and words,…

We consider an extension of the interchange process on the complete graph, in which a fraction of the transpositions are replaced by `reversals'. The model is motivated by statistical physics, where it plays a role in stochastic…

Transfinite set theory including the axiom of choice supplies the following basic theorems: (1) Mappings between infinite sets can always be completed, such that at least one of the sets is exhausted. (2) The real numbers can be well…

Basic properties of Brownian motion are used to derive two results concerning birth-death chains. First, the probability of extinction is calculated. Second, sufficient conditions on the transition probabilities of a birth-death chain are…

This paper establishes a bridge between linear logic and mainstream graph theory, building on previous work by Retor\'e (2003). We show that the problem of correctness for MLL+Mix proof nets is equivalent to the problem of uniqueness of a…

We propose a new method for constructing Turing ideals satisfying principles of reverse mathematics below the Chain-Antichain Principle (CAC). Using this method, we are able to prove several new separations in the presence of Weak Konig's…

We characterize the respective semigroups of mappings that preserve, or that preserve or reverse orientation of a finite cycle, in terms of their actions on oriented triples and oriented quadruples. This leads to a proof that the latter…

The de Bruijn torus (or grid) problem looks to find an $n$-by-$m$ binary matrix in which every possible $j$-by-$k$ submatrix appears exactly once. The existence and construction of these binary matrices was determined in the 70's, with…

Cyclic codes over finite fields are widely implemented in data storage systems, communication systems, and consumer electronics, as they have very efficient encoding and decoding algorithms. They are also important in theory, as they are…

Let k be a field of characteristic p>0. A theorem of de Jong shows that morphisms of modules over W(k)[[t]] with Frobenius and connection structure descend from the completion of W(k)((t)). A careful reading of de Jong's proof suggests the…

In this paper, we describe the formalization of the axiom of choice and several of its famous equivalent theorems in Morse-Kelley set theory. These theorems include Tukey's lemma, the Hausdorff maximal principle, the maximal principle,…

The paper contains a proof of the conjecture of M. Klin and D. Maru$\breve{\rm s}$i$\breve{\rm c}$ that an automorphism group of a transitive graph contains a permutation, decomposed in cycles of the same length. The proof is based on the…

We revisit the problem of designing optimal, individually rational matching mechanisms (in a general sense, allowing for cycles in directed graphs), where each player --- who is associated with a subset of vertices --- matches as many of…