English
Related papers

Related papers: Variations on Noetherianness

200 papers

Systems of equations and their solution sets are studied in polyadic groups. We prove that a polyadic group $(G, f)=\mathrm{der}_{\theta, b}(G, \cdot)$ is equational noetherian, if and only if the ordinary group $(G, \cdot)$ is equational…

Group Theory · Mathematics 2015-09-01 H. Khodabandeh , M. Shahryari

We consider the dimensions of finite type of representations of a partially ordered set, i.e. such that there is only finitely many isomorphism classes of representations of this dimension. We give a criterion for a dimension to be of…

Representation Theory · Mathematics 2012-01-24 Yuriy A. Drozd , Eugene A. Kubichka

In this paper, we introduce a new function related to the sum of element orders of finite groups. It is used to give some criteria for a finite group to be cyclic, abelian, nilpotent, supersolvable and solvable, respectively.

Group Theory · Mathematics 2019-04-09 Marius Tărnăuceanu

Let K be any field and G be a finite group. Noether's problem asks whether the fixed field is rational (=purely transcendental) over K. We will prove that if G is a non-abelian p-group of order p^n containing a cyclic subgroup of index p…

Commutative Algebra · Mathematics 2007-05-23 Ming-chang Kang , Shou-Jen Hu

Let $\Omega\subset{\mathbb R}^n$ be a relatively compact domain. A finite collection of real-valued functions on $\Omega$ is called a \emph{Noetherian chain} if the partial derivatives of each function are expressible as polynomials in the…

Number Theory · Mathematics 2017-04-04 Gal Binyamini

In this article, we describe the relation between the properties of being equational noetherian and ascending chain condition on ideals of an arbitrary algebra. We also give a formulation of Hilbert's basis theorem for varieties of algebras…

Algebraic Geometry · Mathematics 2013-08-16 M. Shahryari

Agda is a dependently-typed programming language and a proof assistant, pivotal in proof formalization and programming language theory. This paper extends the Agda ecosystem into machine learning territory, and, vice versa, makes…

Machine Learning · Computer Science 2024-10-31 Konstantinos Kogkalidis , Orestis Melkonian , Jean-Philippe Bernardy

We prove that an abelian category equipped with an ample sequence of objects is equivalent to the quotient of the category of coherent modules over the corresponding algebra by the subcategory of finite-dimensional modules. In the…

Rings and Algebras · Mathematics 2007-05-23 Alexander Polishchuk

Let $k$ be a commutative Noetherian ring, and $k[S]$ the polynomial ring whose indeterminates are parameterized by elements in a set $S$. We show that $k[S]$ is Noetherian up to highly homogenous actions of groups. In particular, there is a…

Representation Theory · Mathematics 2025-08-25 Liping Li , Yinhe Peng , Zhengjun Yuan

Noether, Fleischmann and Fogarty proved that if the characteristic of the underlying field does not divide the order $|G|$ of a finite group $G$, then the polynomial invariants of $G$ are generated by polynomials of degrees at most $|G|$.…

Group Theory · Mathematics 2018-10-12 Pál Hegedűs , Attila Maróti , László Pyber

Constructions are given of Noetherian maximal orders that are finitely presented algebras over a field K, defined by monomial relations. In order to do this, it is shown that the underlying homogeneous information determines the algebraic…

Rings and Algebras · Mathematics 2007-11-05 Isabel Goffa , Eric Jespers , Jan Okninski

We propose notions of "Noetherian" and "integral" for schemes over an abelian symmetric monoidal category $(\mathcal C,\otimes,1)$. For Noetherian integral schemes, we construct a "function field" that is a commutative monoid object of…

Algebraic Geometry · Mathematics 2016-05-17 Abhishek Banerjee

We present statements equivalent to some fragments of the principle of non-deterministic inductive definitions (NID) by van den Berg (2013), working in a weak subsystem of constructive set theory CZF. We show that several statements in…

Logic · Mathematics 2019-06-25 Ayana Hirata , Hajime Ishihara , Tatsuji Kawai , Takako Nemoto

In order to study the axiomatization of the if-then-else construct over possibly non-halting programs and tests, this paper introduces the notion of $C$-sets by considering the tests from an abstract $C$-algebra. When the $C$-algebra is an…

Logic in Computer Science · Computer Science 2016-09-02 Gayatri Panicker , K. V. Krishna , Purandar Bhaduri

We introduce Voevodsky's univalent foundations and univalent mathematics, and explain how to develop them with the computer system Agda, which is based on Martin-L\"of type theory. Agda allows us to write mathematical definitions,…

Logic in Computer Science · Computer Science 2022-09-05 Martín Hötzel Escardó

A primary ideal in a polynomial ring can be described by the variety it defines and a finite set of Noetherian operators, which are differential operators with polynomial coefficients. We implement both symbolic and numerical algorithms to…

Commutative Algebra · Mathematics 2023-01-25 Justin Chen , Yairon Cid-Ruiz , Marc Härkönen , Robert Krone , Anton Leykin

For a ring $A$, we consider the question whether every bounded above cochain complex of injective $A$-modules which is acyclic is null-homotopic. We show that if $A$ is left and right noetherian and has a dualizing complex, then this…

Rings and Algebras · Mathematics 2023-03-31 Liran Shaul

We prove Noether's direct and inverse second theorems for Lagrangian systems on fiber bundles in the case of gauge symmetries depending on derivatives of dynamic variables of an arbitrary order. The appropriate notions of reducible gauge…

Differential Geometry · Mathematics 2009-11-10 D. Bashkirov , G. Giachetta , L. Mangiarotti , G. Sardanashvily

We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…

Group Theory · Mathematics 2010-12-09 A. Myasnikov , D. Osin

Let $A$ be a finite or countable alphabet and let $\theta$ be literal (anti)morphism onto $A^*$ (by definition, such a correspondence is determinated by a permutation of the alphabet). This paper deals with sets which are invariant under…

Discrete Mathematics · Computer Science 2017-07-28 Jean Néraud , Carla Selmi