Related papers: Methods for Computing Normalisations of Affine Rin…
In this paper homological ideals associated to some Nakayama algebras are characterized and enumerated via integer specializations of some suitable Brauer configuration algebras. Besides, it is shown how the number of such homological…
The book is devoted to investigation of arithmetic of the matrix rings over certain classes of commutative finitely generated principal ideals domains. We mainly concentrate on constructing of the matrix factorization theory. We reveal a…
This paper studies normalisation by evaluation for typed lambda calculus from a categorical and algebraic viewpoint. The first part of the paper analyses the lambda definability result of Jung and Tiuryn via Kripke logical relations and…
We study seminormalization of affine complex varieties. We show that polynomials on the seminormalization correspond to the rational functions which are continuous for the Euclidean topology. We further study this type of functions which…
A method for computing singular or nearly singular integrals on closed surfaces was presented by J. T. Beale, W. Ying, and J. R. Wilson [Comm. Comput. Phys. 20 (2016), 733--753, arXiv:1508.00265] and applied to single and double layer…
Scattering amplitudes at loop level can be expressed in terms of Feynman integrals. The latter satisfy partial differential equations in the kinematical variables. We argue that a good choice of basis for (multi-)loop integrals can lead to…
Classical primal-dual affine programming takes place over finite dimensional real vector spaces. This results in beautiful duality theory, connecting the optimal solu- tions of the primal maximization problem and the dual minimization…
We compute an explicit algebraic deformation quantization for an affine Poisson variety described by an ideal in a polynomial ring, and inheriting its Poisson structure from the ambient space.
Algorithmic computation in polynomial rings is a classical topic in mathematics. However, little attention has been given to the case of rings with an infinite number of variables until recently when theoretical efforts have made possible…
In this paper, we focus on computing the kernel of a map of polynomial rings $\varphi$. This core problem in symbolic computation is known as implicitization. While there are extremely effective Gr\"obner basis methods used to solve this…
In this paper, we apply the theory of cluster algebras to study minimal affinizations for the quantum affine algebra of type $F_4$. We show that the $q$-characters of a large family of minimal affinizations of type $F_4$ satisfy a system of…
We study the finite generation of the intersection algebra of two principal ideals I and J in a unique factorization domain R. We provide an algorithm that produces a list of generators of this algebra over R. In the special case that R is…
This paper proves error estimates for $H^2$ conforming finite elements for equations which model the flow of surfaces by different powers of the mean curvature (this includes mean curvature flow). for an adapted scheme originally proposed…
This note is concerned with a natural generalization of the Mullineux involution for Ariki-Koike algebras. Using a result of Fayers together with previous results by the authors, we give an efficient algorithm for computing this generalized…
Normalizing flows are a class of machine learning models used to construct a complex distribution through a bijective mapping of a simple base distribution. We demonstrate that normalizing flows are particularly well suited as a Monte Carlo…
In [4] we describe a variation of the classical permutation decoding algorithm that can be applied to any binary affine-invariant code; in particular, it can be applied to first-order Reed-Muller codes successfully. In this paper we study…
This paper proposes new factorizations for computing the Neumann series. The factorizations are based on fast algorithms for small prime sizes series and the splitting of large sizes into several smaller ones. We propose a different basis…
We present the $\textit{NumericalImplicitization}$ package for $\textit{Macaulay2}$, which allows for user-friendly computation of the invariants of the image of a polynomial map, such as dimension, degree, and Hilbert function values. This…
In this article, we define three new operations on ideals which generalize integral closure and Frobenius closure of ideals, whose definitions incorporate an auxiliary ideal and a real parameter. These additional ingredients are common in…
We construct quantized versions of generic bases in quantum cluster algebras of finite and affine types. Under the specialization of $q$ and coefficients to 1, these bases are generic bases of finite and affine cluster algebras.