English
Related papers

Related papers: Transfinitely valued Euclidean domains have arbitr…

200 papers

We give examples of atomic integral domains satisfying each of the eight logically possible combinations of existence or non-existence of the following kinds of elements: 1) primes, 2) absolutely irreducible elements that are not prime, and…

Commutative Algebra · Mathematics 2026-01-13 Victor Fadinger , Sophie Frisch , Sarah Nakato , Daniel Smertnig , Daniel Windisch

Transductions are binary relations of finite words. For rational transductions, i.e., transductions defined by finite transducers, the inclusion, equivalence and sequential uniformisation problems are known to be undecidable. In this paper,…

Formal Languages and Automata Theory · Computer Science 2016-03-01 Emmanuel Filiot , Ismaël Jecker , Christof Löding , Sarah Winter

We classify Artin-Schreier extensions of valued fields with non-trivial defect according to whether they are connected with purely inseparable extensions with non-trivial defect, or not. We use this classification to show that in positive…

Commutative Algebra · Mathematics 2013-04-02 Franz-Viktor Kuhlmann

We classify stable and finite Morse index solutions to general semilinear elliptic equations posed in Euclidean space of dimension at most 10, or in some unbounded domains.

Analysis of PDEs · Mathematics 2022-04-27 Louis Dupaigne , ALberto Farina

A computable ring is a ring equipped with mechanical procedure to add and multiply elements. In most natural computable integral domains, there is a computational procedure to determine if a given element is prime/irreducible. However,…

Logic · Mathematics 2014-07-23 Leigh Evron , Joseph R. Mileti , Ethan Ratliff-Crain

We give several generalizations of Rellich's classical uniqueness theorem to unbounded domains. We give a natural half-space generalization for super-exponentially decaying inhomogeneities using real variable techniques. We also prove under…

Analysis of PDEs · Mathematics 2014-09-02 Esa V. Vesalainen

For commutative rings, we introduce the notion of a {\em universal grading}, which can be viewed as the "largest possible grading". While not every commutative ring (or order) has a universal grading, we prove that every {\em reduced order}…

Commutative Algebra · Mathematics 2018-04-18 H. W. Lenstra, , A. Silverberg

Let $D$ be a bounded domain $D$ in $\mathbb R^n $ with infinitely smooth boundary and $n$ is odd. We prove that if the volume cut off from the domain by a hyperplane is an algebraic function of the hyperplane, free of real singular points,…

Metric Geometry · Mathematics 2017-05-23 Mark Agranovsky

We prove that arithmetic is interpretable in any indecomposable polynomial ring (in any set of variables), and in addition we provide an alternative uniform proof of undecidability for all members in this class of rings.

Logic · Mathematics 2023-09-28 Marco Barone , Nicolás Caro-Montoya , Eudes Naziazeno

The main purpose of this paper is investigating classes of acts that are injective relative to all embeddings with indecomposable domains or codomains. We give some homological classifications of monoids in light of such kinds of…

Rings and Algebras · Mathematics 2019-01-24 Mojtaba Sedaghatjoo , Mohammad Ali Naghipoor

In this article, we study the monoid of fractional ideals and the ideal class semigroup of an arbitrary given one dimensional normal domain O obtained by an infinite integral extension of a Dedekind domain. We introduce a notion of "upper…

Number Theory · Mathematics 2018-04-18 Tatsuya Ohshita

Let $T$ be a totally ordered set and let $D(T)$ denote the set of all cuts of $T$. We prove the existence of a discrete valuation domain $O_{v}$ such that $T$ is order isomorphic to two special subsets of Spec$(O_{v})$. We prove that if $A$…

Rings and Algebras · Mathematics 2014-11-17 Shai Sarussi

Unimodularity is localized to a complete stationary type, and its properties are analysed. Some variants of unimodularity for definable and type-definable sets are introduced, and the relationship between these different notions is studied.…

Logic · Mathematics 2016-10-06 Darío García , Frank Olaf Wagner

We classify essential algebras whose irredundant non-refinable covers consist of primal algebras. The proof is obtained by constructing one to one correspondence between such algebras and partial orders on finite sets. Further, we prove…

Logic · Mathematics 2014-06-26 Shohei Izawa

We state a kind of Euclidian division theorem: given a polynomial P(x) and a divisor d of the degree of P, there exist polynomials h(x),Q(x),R(x) such that P(x) = h(Q(x)) +R(x), with deg h=d. Under some conditions h,Q,R are unique, and Q is…

Algebraic Geometry · Mathematics 2009-10-12 Arnaud Bodin

We develop some basic results about full amalgamation classes with intrinsic trascendentals. These classes have generics whose models may have finite subsets whose intrinsic closure is not contained in its algebraic closure. We will show…

Logic · Mathematics 2015-12-15 Justin Brody

Composition principles for reduced moduli are extended to the case of domains in the $n$-dimensional Euclidean space, $n>2$. As a consequence analogues of extremal decomposition theorems of Kufarev, Dubinin and Kirillova in the planer case…

Complex Variables · Mathematics 2015-11-06 Karina Gulyaeva , Sergei Kalmykov , Elena Prilepkina

The notion of maximal non valuative domain is introduced and characterized. An integral domain R is called a maximal non valuative domain if R is not a valuative domain but every proper overring of R is a valuative domain. Maximal non…

Commutative Algebra · Mathematics 2020-09-08 Rahul Kumar , Atul Gaur

We give several characterizations of when a complete first-order theory $T$ is monadically NIP, i.e. when expansions of $T$ by arbitrary unary predicates do not have the independence property. The central characterization is a condition on…

Logic · Mathematics 2026-05-06 Samuel Braunfeld , Michael C. Laskowski

Term modal logics (TML) are modal logics with unboundedly many modalities, with quantification over modal indices, so that we can have formulas of the form $\exists y. \forall x. (\Box_x P(x,y) \supset\Diamond_y P(y,x))$. Like First order…

Logic in Computer Science · Computer Science 2019-06-28 Anantha Padmanabha , R. Ramanujam