中文
相关论文

相关论文: Problems and algorithms for affine semigroups

200 篇论文

We give an exposition of the hidden subgroup problem for dihedral groups from the point of view of the standard hidden subgroup quantum algorithm for finite groups. In particular, we recall the obstructions for strong Fourier sampling to…

量子物理 · 物理学 2024-04-11 Imin Chen , David Sun

We consider applications of a finitary version of the Affine Representability theorem, which follows from recent work of Belov-Kanel, Rowen, and Vishne. Using this result we are able to show that when given a finite set of polynomial…

环与代数 · 数学 2022-03-08 Jason P. Bell , Peter V. Danchev

We give a survey of recent results related to the problem of characterizing finite-dimensional division algebras by the set of isomorphism classes of their maximal subfields. We also discuss various generalizations of this problem and some…

环与代数 · 数学 2015-06-11 Vladimir I. Chernousov , Andrei S. Rapinchuk , Igor A. Rapinchuk

We begin the study of completeness of affine connections, especially those on statistical manifolds as well as on affine hypersurfaces. We collect basic facts, prove new theorems and provide examples with remarkable properties.

微分几何 · 数学 2020-03-27 Barbara Opozda

The author has been interested in regions surrounded by cylinders of real algebraic hypersurfaces and their shapes and polynomials associated to them. Here, we formulate and investigate natural decompositions into such cylinders of real…

代数几何 · 数学 2026-01-13 Naoki Kitazawa

This paper gives a systematic construction of certain covers of finite semigroups. These covers will be used in future work on the complexity of finite semigroups.

群论 · 数学 2019-04-03 John L. Rhodes , Benjamin Steinberg , J. C. Birget

For a semigroup $S$, the covering number of $S$ with respect to semigroups, $\sigma_s(S)$, is the minimum number of proper subsemigroups of $S$ whose union is $S$. This article investigates covering numbers of semigroups and analogously…

群论 · 数学 2020-02-12 Casey Donoven , Luise-Charlotte Kappe

This work introduces a new kind of semigroup of $\N^p$ called proportionally modular affine semigroup. These semigroups are defined by modular Diophantine inequalities and they are a generalization of proportionally modular numerical…

交换代数 · 数学 2016-07-12 J. I. García-García , M. A. Moreno-Frías , A. Vigneron-Tenorio

This is a survey paper on applications of mathematics of semirings to numerical analysis and computing. Concepts of universal algorithm and generic program are discussed. Relations between these concepts and mathematics of semirings are…

数值分析 · 数学 2010-05-10 G. L. Litvinov , V. P. Maslov , A. Ya. Rodionov , A. N. Sobolevski

Groups preserving a distributive product are encountered often in algebra. Examples include automorphism groups of associative and nonassociative rings, classical groups, and automorphism groups of p-groups. While the great variety of such…

群论 · 数学 2015-01-21 Peter A. Brooksbank , James B. Wilson

We consider the problem of classifying gradings by groups on a finite-dimensional algebra $A$ (with any number of multilinear operations) over an algebraically closed field. We introduce a class of gradings, which we call almost fine, such…

环与代数 · 数学 2025-06-24 Alberto Elduque , Mikhail Kochetov

We investigate classifications of quasitrivial semigroups defined by certain equivalence relations. The subclass of quasitrivial semigroups that preserve a given total ordering is also investigated. In the special case of finite semigroups,…

环与代数 · 数学 2020-05-21 Jimmy Devillet , Jean-Luc Marichal , Bruno Teheux

We study the complexity of computation in finitely generated free left, right and two-sided adequate semigroups and monoids. We present polynomial time (quadratic in the RAM model of computation) algorithms to solve the word problem and…

环与代数 · 数学 2013-12-02 Mark Kambites , Alexandr Kazda

We primarily investigate the properties of characteristic polynomials of semimatroids. In particular, we provide a combinatorial interpretation of their coefficients, generalizing the Whitney's Broken Circuit Theorem. We also prove that the…

组合数学 · 数学 2025-08-03 Houshan Fu

This paper introduces new structural decompositions for almost symmetric numerical semigroups through the combinatorial lens of Young diagrams. To do that, we use the foundational correspondence between numerical sets and Young diagrams,…

群论 · 数学 2026-02-13 Mehmet Yeşil

We give an account on what is known on the subject of permutation matchings, which are bijections of a finite regular semigroup that map each element to one of its inverses. This includes partial solutions to some open questions, including…

组合数学 · 数学 2023-09-26 Peter M. Higgins

These notes were prepared for the MSRI hot topics workshop on superstrong approximation (2012). We give a brief overview of the developments in the theory, especially the fundamental expansion theorem. Applications to diophantine problems…

数论 · 数学 2012-12-17 Peter Sarnak

The theory of abelian categories proved very useful, providing an axiomatic framework for homology and cohomology of modules over a ring and, in particular, of abelian groups. For many years, a similar categorical framework has been lacking…

范畴论 · 数学 2007-05-23 Tim Van der Linden

We produce algorithms to detect whether a complex affine variety computed and presented numerically by the machinery of numerical algebraic geometry corresponds to an associated component of a polynomial ideal.

代数几何 · 数学 2016-01-15 Robert Krone , Anton Leykin

We extend Borel's theorem on the dominance of word maps from semisimple algebraic groups to some perfect groups. In another direction, we generalize Borel's theorem to some words with constants. We also consider the surjectivity problem for…

群论 · 数学 2018-04-26 Nikolai Gordeev , Boris Kunyavskii , Eugene Plotkin