Related papers: A characterization of covering equivalence
For any link and for any modulus $m$ we introduce an equivalence relation on the set of non-trivial m-colorings of the link (an m-coloring has values in Z/mZ). Given a diagram of the link, the equivalence class of a non-trivial m-coloring…
There exist a number of results proving that for certain classes of interacting particle systems in population genetics, mutual invadability of types implies coexistence. In this paper we prove a sort of converse statement for a class of…
It is proved that if the least modulus of a distinct covering system is 4, its largest modulus is at least 60; also if the least modulus is 3, the LCM of the moduli is at least 120; finally, if the least modulus is 4, the LCM of the moduli…
The radius of comparison is an invariant for unital C*-algebras which extends the theory of covering dimension to noncommutative spaces. We extend its definition to general C*-algebras, and give an algebraic (as opposed to…
The following is shown : Let $S=\{a_1,a_2,..,a_{2n}\}$ be a subset of a totally ordered commutative semi-group $(G,*,\leq)$ with $a_1\leq a_2\leq...\leq a_{2n}$. Provided that a system of $n$ $a_{i_k} * a_{j_k}\ (a_{i_k}, a_{j_k} \in G ;\ 1…
We try to find all quadruples of positive integers $(m,a,b,c)$ with $a \geq b \geq c$ such that there exists a distinct covering system with minimum modulus $m$ and least common multiple of the moduli $2^a 3^b 5^c$. We obtain complete…
There exist two different languages, the ^sl(2) and N=2 ones, to describe similar structures; a dictionary is given translating the key representation-theoretic terms related to the two algebras. The main tool to describe the structure of…
It is well known that descents and excedances are equidistributed in the symmetric group. We show that the descent and excedance enumerators, summed over permutations with a fixed first letter are identical when we perform a simple change…
We define a notion of equivalence between algebraic dependent type theories which we call Morita equivalence. This notion has a simple syntactic description and an equivalent description in terms of models of the theories. The category of…
A word is quasiperiodic (or coverable) if it can be covered with occurrences of another finite word, called its quasiperiod. A word is multi-scale quasiperiodic (or multi-scale coverable) if it has infinitely many different quasiperiods.…
For a positive integer $t$, let $b_{t}(n)$ denote the number of $t$-regular partitions of a nonnegative integer $n$. In a recent paper, Keith and Zanello established infinite families of congruences and self-similarity results modulo $2$…
Let $A$ be a unital separable amenable \CA and $C$ be a unital \CA with certain infinite property. We show that two full monomorphisms $h_1, h_2: A\to C$ are approximately unitarily equivalent if and only if $[h_1]=[h_2]$ in $KL(A,C).$ Let…
Bin covering is a dual version of classic bin packing. Thus, the goal is to cover as many bins as possible, where covering a bin means packing items of total size at least one in the bin. For online bin covering, competitive analysis fails…
We study correspondences of zero-dimensional subschemes of a smooth variety X "aligned" in the same way in inside the appropriate product of Hilbert schemes. We show that such correspondences have etale covering by other such…
Let A be a basic connected finite dimensional algebra over an algebraically closed field, let G be a group, let T be a basic tilting A-module and let B the endomorphism algebra of T. Under a hypothesis on T, we establish a correspondence…
Two first-order logic theories are definitionally equivalent if and only if there is a bijection between their model classes that preserves isomorphisms and ultraproducts (Theorem 2). This is a variant of a prior theorem of van Benthem and…
Let $\tau\colon\tilde{\mathcal{E}}\to\mathcal{E}$ be a differential covering of a PDE $\tilde{\mathcal{E}}$ over $\mathcal{E}$. We prove that if $\mathcal{E}$ possesses infinite number of symmetries and/or conservation laws then…
We prove expressive completeness results for convex propositional and modal team logics, where a logic is convex if, for each formula, if it is true in two teams $t$ and $u$ and $t\subseteq s\subseteq u$, then it is also true in $s$. We…
Bob Hough recently disproved a long-standing conjecture of Paul Erd\H{o}s regarding covering systems. Inspired by his seminal paper, we describe analogs of covering systems to Boolean functions, and more generally, the problem of covering…
To a big n-tilting object in a complete, cocomplete abelian category A with an injective cogenerator we assign a big n-cotilting object in a complete, cocomplete abelian category B with a projective generator, and vice versa. Then we…