中文
相关论文

相关论文: On the reducibility of exact covering systems

200 篇论文

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

数论 · 数学 2021-05-25 Robert D. Hough , Pace P. Nielsen

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…

数论 · 数学 2026-05-19 Joshua Harrington , Jonah Klein , Joshua Lowrance , Ognian Trifonov

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…

数论 · 数学 2022-02-11 Jack Dalton , Ognian Trifonov

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…

We introduce special classes of irreducible representations of groups: thick representations and dense representations. Denseness implies thickness, and thickness implies irreducibility. We show that absolute thickness and absolute…

代数几何 · 数学 2019-05-10 Kazunori Nakamoto , Yasuhiro Omoda

A module is called absolutely indecomposable if it is directly indecomposable in every generic extension of the universe. We want to show the existence of large abelian groups that are absolutely indecomposable. This will follow from a more…

逻辑 · 数学 2007-11-21 Rüdiger Göbel , Saharon Shelah

On restriction to the maximal compact subgroup $\mathrm{GL}(3,\mathscr{R})$, an unramified principal series representation of the $p$-adic group $\mathrm{GL}(3,F)$ decomposes into a direct sum of finite-dimensional irreducibles each…

表示论 · 数学 2007-10-18 Peter S. Campbell , Monica Nevins

Elementary Object Systems (EOS) are a form of Petri Net (PN) where tokens carry internal PN. This model has been recently proposed for analysis of robustness of Multi Agent Systems. While EOS reachability is known to be undecidable, the…

计算复杂性 · 计算机科学 2025-04-07 Francesco Di Cosmo , Soumodev Mal , Tephilla Prince

Assuming the obvious definitions (see paper) we show the a decidable model that is effectively prime is also effectively atomic. This implies that two effectively prime (decidable) models are computably isomorphic. This is in contrast to…

逻辑 · 数学 2017-01-31 Peter Cholak , Charlie McCoy

We show that if a graded submodule of a Noetherian module cannot be written as a proper intersection of graded submodules, then it cannot be written as a proper intersection of submodules at all. More generally, we show that a natural…

交换代数 · 数学 2016-10-03 Justin Chen , Youngsu Kim

We describe a straightforward construction of the pseudo-split absolutely pseudo-simple groups of minimal type with irreducible root systems of type $BC_n$; these exist only in characteristic $2$. We also give a formula for the dimensions…

群论 · 数学 2024-01-09 Michael Bate , Gerhard Röhrle , Damian Sercombe , David I. Stewart

The Erdos-Straus conjecture (ESC) concerns the representation of the fraction 4/P, where P is a prime number, as a sum of three positive unit fractions. The focus here is on the case when P is congruent to 1 modulo 4. Two constructive…

数论 · 数学 2025-11-12 E. Dyachenko

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…

表示论 · 数学 2024-10-29 Matthew Fayers , Lucia Morotti

The Kochen-Specker theorem states that a 3-dimensional complex Euclidean space admits a finite configuration of projective lines such that the corresponding quantum observables (the orthogonal projectors) cannot be assigned with 0 and 1…

量子物理 · 物理学 2015-05-13 Artur Ruuge

A planar set $P$ is said to be cover-decomposable if there is a constant $k=k(P)$ such that every $k$-fold covering of the plane with translates of $P$ can be decomposed into two coverings. It is known that open convex polygons are…

度量几何 · 数学 2014-03-12 István Kovács , Géza Tóth

Using elementary cellular automata (CA) as an example, we show how to coarse-grain CA in all classes of Wolfram's classification. We find that computationally irreducible (CIR) physical processes can be predictable and even computationally…

元胞自动机与格子气 · 物理学 2009-11-10 Navot Israeli , Nigel Goldenfeld

A split of a polytope is a (necessarily regular) subdivision with exactly two maximal cells. A polytope is totally splittable if each triangulation (without additional vertices) is a common refinement of splits. This paper establishes a…

组合数学 · 数学 2014-12-23 Sven Herrmann , Michael Joswig

We construct the first examples of what we call fake ES-irreducible components; Definition 2.8. In our way to do so, we classify the automorphism groups of smooth plane sextics that only have automorphisms of order 3 or less; Theorems 2.1,…

代数几何 · 数学 2023-09-19 Eslam Badr , Francesc Bars

New exact modular branching rules are obtained for modules over the symmetric groups that are close to completely splittable modules. These results are based on some upper bounds for the Ext^1-spaces between simple modules.

表示论 · 数学 2015-06-26 Vladimir Shchigolev

In the paper we present results to develop an irreducible theory of complex systems in terms of self-organization processes of prime integer relations. Based on the integers and controlled by arithmetic only the self-organization processes…

适应与自组织系统 · 物理学 2007-05-23 Victor Korotkikh , Galina Korotkikh
‹ 上一页 1 2 3 10 下一页 ›