English
Related papers

Related papers: Variations on Noetherianness

200 papers

In this paper we develop in detail the geometric constructions that lead to many uniqueness results for the determination of polyhedral sets, typically scatterers, by a finite minimal number of measurements. We highlight how unique…

Analysis of PDEs · Mathematics 2023-10-10 Luca Rondi

A countable group is residually finite if every nontrivial element can act nontrivially on a finite set. When a group fails to be residually finite, we might want to measure how drastically it fails - it could be that only finitely many…

Group Theory · Mathematics 2024-01-11 Nic Brody , Kasia Jankiewicz

We present a novel dependent linear type theory in which the multiplicity of some variable-i.e., the number of times the variable can be used in a program-can depend on other variables. This allows us to give precise resource annotations to…

Programming Languages · Computer Science 2026-05-20 Maximilian Doré

We study representations of wreath product analogues of categories of finite sets. This includes the category of finite sets and injections (studied by Church, Ellenberg, and Farb) and the opposite of the category of finite sets and…

Representation Theory · Mathematics 2019-05-14 Steven V Sam , Andrew Snowden

The cohomology of coherent sheaves and sheaves of Abelian groups on Noetherian schemes are interpreted in second order arithmetic by means of a finiteness theorem. This finiteness theorem provably fails for the etale topology even on…

Logic · Mathematics 2012-07-26 Colin McLarty

Quasi-Noether differential systems are more general than variational systems and are quite common in mathematical physics. They include practically all differential systems of interest, at least those that have conservation laws. In this…

Mathematical Physics · Physics 2016-04-20 V. Rosenhaus , Ravi Shankar

G\"odel's second incompleteness theorem is standardly understood as showing that no sufficiently strong, consistent theory of arithmetic can prove its own consistency, a result typically interpreted against a model-theoretic background in…

Logic · Mathematics 2026-03-11 Alexander V. Gheorghiu

We study equations over boolean algebras with distinguished elements. We prove the criteria, when a boolean algebra is equationally Noetherian, weakly equationally Noetherian, $\mathbf{q}_\omega$-compact or $\mathbf{u}_\omega$-compact. Also…

Rings and Algebras · Mathematics 2013-05-30 Artem N. Shevlyakov

The goal of this expository article, based on a lecture I gave at the 2016 ICRA, is to explain some recent applications of "categorical symmetries" in topology and algebraic geometry with an eye toward twisted commutative algebras as a…

Representation Theory · Mathematics 2018-05-09 Steven V Sam

We prove that two arbitrary ideals $I \subset J$ in an equidimensional and universally catenary Noetherian local ring have the same integral closure if and only if they have the same multiplicity sequence. We also obtain a Principle of…

Commutative Algebra · Mathematics 2021-10-18 Claudia Polini , Ngo Viet Trung , Bernd Ulrich , Javid Validashti

We study systems of equations over graphs, posets and matroids. We give the criteria, when a direct power of such algebraic structures is equationally Noetherian. Moreover we prove that any direct power of a finite algebraic structure is…

Algebraic Geometry · Mathematics 2020-08-10 A. Shevlyakov

We consider the termination/non-termination property of a class of loops. Such loops are commonly used abstractions of real program pieces. Second-order logic is a convenient language to express non-termination. Of course, such property is…

Logic in Computer Science · Computer Science 2014-12-11 Fred Mesnard , Etienne Payet

For a finite abelian group $G$, let $\beta_{\mathrm{sep}}(G)$ denote its separating Noether number. We determine $\beta_{\mathrm{sep}}(G)$ exactly for every finite abelian group $ G \cong C_{n_1}\oplus \cdots \oplus C_{n_r}$ with $ 1<n_1…

Commutative Algebra · Mathematics 2026-03-25 Jing Huang

Five algebraic notions of termination are formalised, analysed and compared: wellfoundedness or Noetherity, L\"ob's formula, absence of infinite iteration, absence of divergence and normalisation. The study is based on modal semirings,…

Logic in Computer Science · Computer Science 2015-07-01 Desharnais Jules , Bernhard Moeller , Struth Georg

We generalize the notion of length to an ordinal-valued invariant defined on the class of finitely generated modules over a Noetherian ring. A key property of this invariant is its semi-additivity on short exact sequences. As an…

Commutative Algebra · Mathematics 2012-10-16 Hans Schoutens

We combine several folklore observations to provide a working framework for iterating constructions which contradict the axiom of choice. We use this to define a model in which any kind of structural failure must fail with a proper class of…

Logic · Mathematics 2021-07-26 Asaf Karagila

We give a simple example of a set that is weakly Dedekind infinite (= can be mapped onto omega) but dually Dedekind finite (=cannot be mapped noninjectively onto itself), namely, the power set of a superamorphous set. (A infinite set is…

Logic · Mathematics 2016-09-06 Martin Goldstern

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…

Commutative Algebra · Mathematics 2016-10-03 Justin Chen , Youngsu Kim

Let $S^{\cdot}$ be a noetherian graded algebra over a commutative $k$-algebra $A$, where $k$ is a commutative ring, and assume it is a module over a Lie algebroid ${\mathfrak g}_{A/k}$. If $S^\cdot$ is semi-simple over ${\mathfrak g}_{A/k}$…

Rings and Algebras · Mathematics 2012-12-20 Rolf Källström

Some notions in mathematics can be considered relative. Relative is a term used to denote when the variation in the position of an observer implies variation in properties or measures on the observed object. We know, from Skolem theorem,…

Logic in Computer Science · Computer Science 2016-03-04 Edward Hermann Haeusler