English
Related papers

Related papers: A characterization of covering equivalence

200 papers

Let {a_s(mod n_s)}_{s=1}^k (k>1) be a finite system of residue classes with the moduli n_1,...,n_k distinct. By means of algebraic integers we show that the range of the covering function w(x)=|{1\le s\le k: x=a_s (mod n_s)}| is not…

Number Theory · Mathematics 2007-05-23 Zhi-Wei Sun

For integers a and n>0, let a(n) denote the residue class {x\in Z: x=a (mod n)}. Let A be a collection {a_s(n_s)}_{s=1}^k of finitely many residue classes such that A covers all the integers at least m times but {a_s(n_s)}_{s=1}^{k-1} does…

Number Theory · Mathematics 2007-05-23 Zhi-Wei Sun

A $\textit{covering system}$ is a collection of integer congruences such that every integer satisfies at least one congruence in the collection. A covering system is called $\textit{distinct}$ if all of its moduli are distinct. An expansive…

Number Theory · Mathematics 2023-08-24 Raj Agrawal , Prarthana Bhatia , Kratik Gupta , Powers Lamb , Andrew Lott , Alex Rice , Christine Rose Ward

An old question of Erdos asks if there exists, for each number N, a finite set S of integers greater than N and residue classes r(n) mod n for n in S whose union is all the integers. We prove that if $\sum_{n\in S} 1/n$ is bounded for such…

Number Theory · Mathematics 2007-05-23 Michael Filaseta , Kevin Ford , Sergei Konyagin , Carl Pomerance , Gang Yu

Covering arrays for words of length $t$ over a $d$ letter alphabet are $k \times n$ arrays with entries from the alphabet so that for each choice of $t$ columns, each of the $d^t$ $t$-letter words appears at least once among the rows of the…

Combinatorics · Mathematics 2018-03-20 Joshua Cassels , Anant Godbole

Given two finite covers $p: X \to S$ and $q: Y \to S$ of a connected, oriented, closed surface $S$ of genus at least $2$, we attempt to characterize the equivalence of $p$ and $q$ in terms of which curves lift to simple curves. Using…

Geometric Topology · Mathematics 2020-07-01 Tarik Aougab , Max Lahn , Marissa Loving , Yang Xiao

Erd\H{o}s and Graham (Erd\H{o}s and Graham, 1980) asked if there exists an $n$ such that the divisors of $n$ greater than 1 are the moduli of a distinct covering system with the following property: If there exists an integer which satisfies…

Number Theory · Mathematics 2025-12-04 Sarosh Adenwalla

Let A={a_s(mod n_s)}_{s=0}^k be a system of residue classes. With the help of cyclotomic fields we obtain a theorem which unifies several previously known results concerning system A. In particular, we show that if every integer lies in…

Number Theory · Mathematics 2007-05-23 Zhi-Wei Sun

A famous unsolved conjecture of P. Erdos and J. L. Selfridge states that there does not exist a covering system {a_s(mod n_s)}_{s=1}^k with the moduli n_1,...,n_k odd, distinct and greater than one. In this paper we show that if such a…

Number Theory · Mathematics 2007-05-23 Song Guo , Zhi-Wei Sun

Any finite algebraic Galois covering corresponds to an algebraic Morita equivalence. Here the $C^*$-algebraic analog of this fact is proven, i.e. any noncommutative finite-fold covering corresponds to a strong Morita equivalence.

Operator Algebras · Mathematics 2018-01-16 Petr Ivankov

We prove that every distinct covering system has a modulus divisible by either 2 or 3.

Number Theory · Mathematics 2021-05-25 Robert D. Hough , Pace P. Nielsen

Let $G$ be a matching-covered graph, i.e., every edge is contained in a perfect matching. An edge subset $X$ of $G$ is feasible if there exists two perfect matchings $M_1$ and $M_2$ such that $|M_1\cap X|\not\equiv |M_2\cap X| \pmod 2$.…

Combinatorics · Mathematics 2017-03-20 Jinghua He , Erling Wei , Dong Ye , Shaohui Zhai

A set of arithmetical sequences $$ a_1\, (\bmod{ \,\, m_1}) \quad, \quad a_2 \, (\bmod{\,\, m_2}) \quad, \quad \dots \quad , \quad a_k \, (\bmod{\,\,m_k}) \quad \quad , $$ with $$ m_1 \leq m_2 \leq \dots \leq m_k \quad \quad , $$ is called…

Combinatorics · Mathematics 2015-11-16 Shalosh B. Ekhad , Aviezri S. Fraenkel , Doron Zeilberger

We prove that an equivalent condition for a uniform space to be coverable is that the images of the natural projections in the fundamental inverse system are uniformly open in a certain sense. As corollaries we (1) obtain a concrete way to…

General Topology · Mathematics 2007-10-11 Conrad Plaut

It is known that if A and B are two n-by-n complex matrices and (A,A^T) is simultaneously equivalent to (B,B^T), then A is congruent to B. We extend this statement to multilinear forms.

Representation Theory · Mathematics 2007-10-04 Genrich R. Belitskii , Vladimir V. Sergeichuk

We classify globally irreducible representations of alternating groups and double covers of symmetric and alternating groups. In order to achieve this classification we also completely characterise irreducible representations of such groups…

Representation Theory · Mathematics 2024-10-29 Matthew Fayers , Lucia Morotti

Given a group G and positive integers k,n, we let B_n=B_n(G) denote the set of all elements x in G such that |x^G|\leq n, and we say that G satisfies the (k,n)-covering condition for commutators if there is a subset S in G such that |S|\leq…

Group Theory · Mathematics 2025-01-03 Eloisa Detomi , Marta Morigi , Pavel Shumyatsky

We develop category theory within Univalent Foundations, which is a foundational system for mathematics based on a homotopical interpretation of dependent type theory. In this system, we propose a definition of "category" for which equality…

Category Theory · Mathematics 2019-02-20 Benedikt Ahrens , Chris Kapulkin , Michael Shulman

Two unital operator algebras A, B are called Delta-equivalent if there exists an equivalence functor between the categories A-mod and B-mod which "extends" to a *-functor implementing an equivalence between the categories A-dmod and B-dmod.…

Operator Algebras · Mathematics 2007-09-06 G. K. Eleftherakis

This paper introduces the sequence covering similarity, that we formally define for evaluating the similarity between a symbolic sequence (string) and a set of symbolic sequences (strings). From this covering similarity we derive a…

Data Structures and Algorithms · Computer Science 2018-03-12 Pierre-François Marteau
‹ Prev 1 2 3 10 Next ›