Related papers: Mora's holy grail: Algorithms for computing in loc…

The convergence rate of various first-order optimization algorithms is a pivotal concern within the numerical optimization community, as it directly reflects the efficiency of these algorithms across different optimization problems. Our…

We investigate whether the group algebra of a finite group over a localisation of the integers is semiperfect. The main result is a necessary and sufficient arithmetic criterion in the ordinary case. In the modular case, we propose a…

We present a classification algorithm for isolated hypersurface singularities of corank 2 and modality 1 over the real numbers. For a singularity given by a polynomial over the rationals, the algorithm determines its right equivalence class…

Given a matrix $A$, a linear feasibility problem (of which linear classification is a special case) aims to find a solution to a primal problem $w: A^Tw > \textbf{0}$ or a certificate for the dual problem which is a probability distribution…

We describe efficient differentiation methods for computing Jacobians and gradients of a large class of matrix functions including the matrix logarithm $\log(A)$ and $p$-th roots $A^{\frac{1}{p}}$. We exploit contour integrals and conformal…

This is a survey article on real algebra and geometry, and in particular on its recent applications in optimization and convexity. We first introduce basic notions and results from the classical theory. We then explain how these relate to…

The theory of $n$-fold integer programming has been recently emerging as an important tool in parameterized complexity. The input to an $n$-fold integer program (IP) consists of parameter $A$, dimension $n$, and numerical data of binary…

We investigate the arithmetic of algebraic curves on coarse moduli spaces for special linear rank two local systems on surfaces with fixed boundary traces. We prove a structure theorem for morphisms from the affine line into the moduli…

For a Del Pezzo surface of degree 8 given over the rationals we decide whether there is a rational parametrization of the surface and construct one in the affirmative case. We define and use the Lie algebra of the surface to reach the aim.…

We show that the Feng-Rao bound for dual codes and a similar bound by Andersen and Geil [H.E. Andersen and O. Geil, Evaluation codes from order domain theory, Finite Fields Appl., 14 (2008), pp. 92-123] for primary codes are consequences of…

Let K be a field equipped with a valuation. Tropical varieties over K can be defined with a theory of Gr{\"o}bner bases taking into account the valuation of K. Because of the use of the valuation, the theory of tropical Gr{\"o}bner bases…

We develop algebraic geometry for general Segal's Gamma-rings and show that this new theory unifies two approaches we had considered earlier on (for a geometry under Spec Z). The starting observation is that the category obtained by gluing…

The affine Hilbert function is a classical algebraic object that has been central, among other tools, to the development of the polynomial method in combinatorics. Owing to its concrete connections with Gr\"obner basis theory, as well as…

In this paper, we investigate some topics around the closed image $S$ of a rational map $\lambda$ given by some homogeneous elements $f_1,...,f_n$ of the same degree in a graded algebra $A$. We first compute the degree of this closed image…

Although Buchberger's algorithm, in theory, allows us to compute Gr\"obner bases over any field, in practice, however, the computational efficiency depends on the arithmetic of the ground field. Consider a field $K = \mathbb{Q}(\alpha)$, a…

We prove that in a locally finite dimensional Lie algebra L, any maximal, locally solvable subalgebra (Borel subalgebra) is the stabilizer of a maximal, generalized flag in an integrable, faithful module over L.

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…

We give a combinatorial description of local cohomology modules of a graded module over a semigroup ring, with support at the graded maximal ideal. This combinatorial framework yields Hochster-type formulas for the Hilbert series of such…

In this paper we present a new efficient variant to compute strong Gr\"obner basis over quotients of principal ideal domains. We show an easy lifting process which allows us to reduce one computation over the quotient $R/nR$ to two…

In this paper we present a natural language programming framework to consider how the fairness of acts can be measured. For the purposes of the paper, a fair act is defined as one that one would be accepting of if it were done to oneself.…