Narrow your search

Library

ULiège (2)

FARO (1)

KU Leuven (1)

LUCA School of Arts (1)

Odisee (1)

Thomas More Kempen (1)

Thomas More Mechelen (1)

UCLL (1)

ULB (1)

VIVES (1)

More...

Resource type

book (4)


Language

English (4)


Year
From To Submit

2022 (1)

2021 (3)

Listing 1 - 4 of 4
Sort by

Book
Cancellation for Surfaces Revisited.
Authors: --- ---
ISBN: 147047171X Year: 2022 Publisher: Providence : American Mathematical Society,

Loading...
Export citation

Choose an application

Bookmark

Abstract

"The celebrated Zariski Cancellation Problem asks as to when the existence of an isomorphism X An X An for (affine) algebraic varieties X and X implies that X X. In this paper we provide a criterion for cancellation by the affine line (that is, n 1) in the case where X is a normal affine surface admitting an A1-fibration X B with no multiple fiber over a smooth affine curve B. For two such surfaces X B and X B we give a criterion as to when the cylinders X A1 and X A1 are isomorphic over B. The latter criterion is expressed in terms of linear equivalence of certain divisors on the Danielewski-Fieseler quotient of X over B. It occurs that for a smooth A1-fibered surface X B the cancellation by the affine line holds if and only if X B is a line bundle, and, for a normal such X, if and only if X B is a cyclic quotient of a line bundle (an orbifold line bundle). If X does not admit any A1-fibration over an affine base then the cancellation by the affine line is known to hold for X by a result of Bandman and Makar-Limanov. If the cancellation does not hold then X deforms in a non-isotrivial family of A1-fibered surfaces B with cylinders A1 isomorphic over B. We construct such versal deformation families and their coarse moduli spaces provided B does not admit nonconstant invertible functions. Each of these coarse moduli spaces has infinite number of irreducible components of growing dimensions; each component is an affine variety with quotient singularities. Finally, we analyze from our viewpoint the examples of non-cancellation constructed by Danielewski, tom Dieck, Wilkens, Masuda and Miyanishi, e.a"--


Book
Mathematical Logic and Its Applications 2020
Authors: ---
Year: 2021 Publisher: Basel, Switzerland MDPI - Multidisciplinary Digital Publishing Institute

Loading...
Export citation

Choose an application

Bookmark

Abstract

The issue "Mathematical Logic and Its Applications 2020" contains articles related to the following three directions: Descriptive Set Theory (3 articles). Solutions for long-standing problems, including those of A. Tarski and H. Friedman, are presented. Exact combinatorial optimization algorithms, in which the complexity relative to the source data is characterized by a low, or even first degree, polynomial (1 article). III. Applications of mathematical logic and the theory of algorithms (2 articles). The first article deals with the Jacobian and M. Kontsevich’s conjectures, and algorithmic undecidability; for these purposes, non-standard analysis is used. The second article provides a quantitative description of the balance and adaptive resource of a human. Submissions are invited for the next issue "Mathematical Logic and Its Applications 2021"


Book
Mathematical Logic and Its Applications 2020
Authors: ---
Year: 2021 Publisher: Basel, Switzerland MDPI - Multidisciplinary Digital Publishing Institute

Loading...
Export citation

Choose an application

Bookmark

Abstract

The issue "Mathematical Logic and Its Applications 2020" contains articles related to the following three directions: Descriptive Set Theory (3 articles). Solutions for long-standing problems, including those of A. Tarski and H. Friedman, are presented. Exact combinatorial optimization algorithms, in which the complexity relative to the source data is characterized by a low, or even first degree, polynomial (1 article). III. Applications of mathematical logic and the theory of algorithms (2 articles). The first article deals with the Jacobian and M. Kontsevich’s conjectures, and algorithmic undecidability; for these purposes, non-standard analysis is used. The second article provides a quantitative description of the balance and adaptive resource of a human. Submissions are invited for the next issue "Mathematical Logic and Its Applications 2021"


Book
Mathematical Logic and Its Applications 2020
Authors: ---
Year: 2021 Publisher: Basel, Switzerland MDPI - Multidisciplinary Digital Publishing Institute

Loading...
Export citation

Choose an application

Bookmark

Abstract

The issue "Mathematical Logic and Its Applications 2020" contains articles related to the following three directions: Descriptive Set Theory (3 articles). Solutions for long-standing problems, including those of A. Tarski and H. Friedman, are presented. Exact combinatorial optimization algorithms, in which the complexity relative to the source data is characterized by a low, or even first degree, polynomial (1 article). III. Applications of mathematical logic and the theory of algorithms (2 articles). The first article deals with the Jacobian and M. Kontsevich’s conjectures, and algorithmic undecidability; for these purposes, non-standard analysis is used. The second article provides a quantitative description of the balance and adaptive resource of a human. Submissions are invited for the next issue "Mathematical Logic and Its Applications 2021"

Keywords

Research & information: general --- Mathematics & science --- definability --- nonconstructible reals --- projective hierarchy --- generic models --- almost disjoint forcing --- Harvey Friedman’s problem --- almost-disjoint forcing --- universal algebraic geometry --- affine algebraic geometry --- elementary equivalence --- isotypic algebras --- first order rigidity --- Ind-group --- affine spaces --- automorphisms --- free associative algebras --- Weyl algebra automorphisms --- polynomial symplectomorphisms --- deformation quantization --- infinite prime number --- semi-inner automorphism --- embeddability of varieties --- undecidability --- noncommutative Gröbner-Shirshov basis --- finitely presented algebraic systems --- algorithmic unsolvability --- turing machine --- discrete optimization --- exact algorithm --- additively exact algorithm --- graph transformation --- graph of degree 2 --- chain-cycle graph --- operation cost --- minimization of total cost --- definability of definable --- tarski problem --- type theoretic hierarchy --- adaptive resource --- resilience --- resistance --- tipping point --- theory of catastrophes --- definability --- nonconstructible reals --- projective hierarchy --- generic models --- almost disjoint forcing --- Harvey Friedman’s problem --- almost-disjoint forcing --- universal algebraic geometry --- affine algebraic geometry --- elementary equivalence --- isotypic algebras --- first order rigidity --- Ind-group --- affine spaces --- automorphisms --- free associative algebras --- Weyl algebra automorphisms --- polynomial symplectomorphisms --- deformation quantization --- infinite prime number --- semi-inner automorphism --- embeddability of varieties --- undecidability --- noncommutative Gröbner-Shirshov basis --- finitely presented algebraic systems --- algorithmic unsolvability --- turing machine --- discrete optimization --- exact algorithm --- additively exact algorithm --- graph transformation --- graph of degree 2 --- chain-cycle graph --- operation cost --- minimization of total cost --- definability of definable --- tarski problem --- type theoretic hierarchy --- adaptive resource --- resilience --- resistance --- tipping point --- theory of catastrophes

Listing 1 - 4 of 4
Sort by