English
Related papers

Related papers: An algorithmic approach to the Polydegree Conjectu…

200 papers

In this paper we show that an affine space is determined by the abstract group structure of its group of regular automorphisms in the category of connected affine varieties. To prove this we study commutative subgroups of the group of…

Algebraic Geometry · Mathematics 2022-03-17 Serge Cantat , Andriy Regeta , Junyi Xie

Hyperplanes and hyperplane complements in the Segre product of partial linear spaces are investigated . The parallelism of such a complement is characterized in terms of the point-line incidence. Assumptions, under which the automorphisms…

Combinatorics · Mathematics 2014-10-31 K. Petelczyc , M. Żynel

We describe a procedure for constructing morphisms in additive categories, combining Auslander's concept of a morphism determined by an object with the existence of flat covers. Also, we show how flat covers are turned into projective…

Category Theory · Mathematics 2014-06-26 Henning Krause

We construct an algorithm that, given a pair of homomorphisms between polycyclic-by-finite groups, determines whether their Reidemeister number is finite, and if so returns a set of representatives of the twisted conjugacy classes.…

Group Theory · Mathematics 2026-05-11 Sam Tertooy

The module category of any artin algebra is filtered by the powers of its radical, thus defining an associated graded category. As an extension of the degree of irreducible morphisms, this text introduces the degree of morphisms in the…

Representation Theory · Mathematics 2018-05-22 Claudia Chaio , Patrick Le Meur , Sonia Trepode

In this paper, we examine an analogue of the recently solved spectrum conjecture by Fujita in the setting of Fine polyhedral adjunction theory. We present computational results for lower-dimensional polytopes, which lead to a complete…

Combinatorics · Mathematics 2026-01-07 Sofía Garzón Mora , Christian Haase

The study of automorphisms of computable and other structures connects computability theory with classical group theory. Among the noncomputable countable structures, computably enumerable structures are one of the most important objects of…

Logic · Mathematics 2018-11-06 Rumen Dimitrov , Valentina Harizanov , Andrey Morozov

In this paper we give a combinatorial view on the adjunction theory of toric varieties. Inspired by classical adjunction theory of polarized algebraic varieties we define two convex-geometric notions: the Q-codegree and the nef value of a…

Combinatorics · Mathematics 2016-01-20 Sandra Di Rocco , Christian Haase , Benjamin Nill , Andreas Paffenholz

This paper focuses on the derivations and automorphism groups of certain finite-dimensional associative algebras over the field of complex numbers. Using classification results for algebras of dimensions two, three, and four, along with…

Rings and Algebras · Mathematics 2025-01-06 Ahmed Zahari Abdou , Bouzid Mosbahi

In this paper, we give algorithms for determining the existence of isomorphism between two finite-dimensional Lie algebras and compute such an isomorphism in the affirrmative case. We also provide algorithms for determining algebraic…

Rings and Algebras · Mathematics 2021-02-23 Tuan A. Nguyen , Vu A. Le , Thieu N. Vo

In this note we prove that any affine algebraic monoid can be obtained as the endomorphisms' monoid of a finite-dimensional (nonassociative) algebra.

Algebraic Geometry · Mathematics 2025-03-06 Alexander Perepechko

We introduce an efficient way, called Newton algorithm, to study arbitrary ideals in C[[x,y]], using a finite succession of Newton polygons. We codify most of the data of the algorithm in a useful combinatorial object, the Newton tree. For…

Algebraic Geometry · Mathematics 2014-02-26 Pierrette Cassou-Noguès , Willem Veys

We give an explicit description of the automorphism group of a product of complete toric varieties over an arbitrary field in terms of the respective automorphism groups of its components. More precisely, we prove that, up to permutation of…

Algebraic Geometry · Mathematics 2022-11-29 Alvaro Liendo , Giancarlo Lucchini Arteche

An orbit polytope is the convex hull of an orbit under a finite group $G \leq \operatorname{GL}(d,\mathbb{R})$. We develop a general theory of possible affine symmetry groups of orbit polytopes. For every group, we define an open and dense…

Metric Geometry · Mathematics 2015-11-30 Erik Friese , Frieder Ladisch

A well-known conjecture states that the Whitney numbers of the second kind of a geometric lattice (simple matroid) are logarithmically concave. We show this conjecture to be equivalent to proving an upper bound on the number of new copoints…

Combinatorics · Mathematics 2011-11-10 W. M. B. Dukes

In [2], while studying a relevant class of polyominoes that tile the plane by translation, i.e., double square polyominoes, the authors found that their boundary words, encoded by the Freeman chain coding on a four letters alphabet, have…

Combinatorics · Mathematics 2023-05-09 Michela Ascolese , Andrea Frosini

It is conjectured that there exist finitely many isomorphism classes of simple endomorphism algebras of abelian varieties of GL_2-type over \Q of bounded dimension. We explore this conjecture when particularized to quaternion endomorphism…

Number Theory · Mathematics 2011-11-10 Nils Bruin , E. Victor Flynn , Josep Gonzalez , Victor Rotger

We study a new class of infinite dimensional Lie algebras, which has important applications to the theory of integrable equations. The construction of these algebras is very similar to the one for automorphic functions and this motivates…

Mathematical Physics · Physics 2009-11-10 S. Lombardo , A. V. Mikhailov

We introduce a class of automorphisms of rooted $d$-regular trees arising from affine actions on their boundaries viewed as infinite dimensional vector spaces. This class includes, in particular, many examples of self-similar realizations…

Group Theory · Mathematics 2015-10-29 Dmytro M. Savchuk , Said N. Sidki

To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excludes solutions with zero components, an irreducible…

Symbolic Computation · Computer Science 2014-05-05 Danko Adrovic , Jan Verschelde