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

Research on the distribution of prime numbers has revealed a dual character: deterministic in definition yet exhibiting statistical behavior reminiscent of random processes. In this paper we show that it is possible to use an image-focused…

This article aims to explore the bridge between the algebraic structure of a linear code and the complete decoding process. To this end, we associate a specific binomial ideal $I_+(\mathcal C)$ to an arbitrary linear code. The binomials…

We analyse the complexity of solving the discrete logarithm problem and of testing the principality of ideals in a certain class of number fields. We achieve the subexponential complexity in $O(L(1/3,O(1)))$ when both the discriminant and…

The theory of "subalgebra basis" analogous to standard basis (the generalization of Gr\"{o}bner bases to monomial ordering which are not necessarily well ordering \cite{GP1}.) for ideals in polynomial rings over a field is developed. We…

The classification of local Artinian Gorenstein algebras is equivalent to the study of orbits of a certain non-reductive group action on a polynomial ring. We give an explicit formula for the orbits and their tangent spaces. We apply our…

Grover's algorithm relies on the superposition and interference of quantum mechanics, which is more efficient than classical computing in specific tasks such as searching an unsorted database. Due to the high complexity of quantum…

Interior Point Methods are widely used to solve Linear Programming problems. In this work, we present two primal affine scaling algorithms to achieve faster convergence in solving Linear Programming problems. In the first algorithm, we…

Heuristic search-based planning techniques are commonly used for motion planning on discretized spaces. The performance of these algorithms is heavily affected by the resolution at which the search space is discretized. Typically a fixed…

In applications with significant class imbalance or asymmetric costs, metrics such as the $F_\beta$-measure, AM measure, Jaccard similarity coefficient, and weighted accuracy offer more suitable evaluation criteria than standard binary…

Let Q be an affine semigroup generating Z^d, and fix a finitely generated Z^d-graded module M over the semigroup algebra k[Q] for a field k. We provide an algorithm to compute a minimal Z^d-graded injective resolution of M up to any desired…

Necessary and sufficient conditions are given for the completed group algebras of a compact p-adic analytic group with coefficient ring the p-adic integers or the field of p elements to be prime, semiprime and a domain. Necessary and…

We give the images of the adjoint representations of exceptional simple Lie algebras by matrices over complex numbers. Next, we digitalize these matrices by the use of Maxima, which is a computer algebra system. These digitalized matrices…

In this work, we consider the problem of computing triangular bases of integral closures of one-dimensional local rings. Let $(K, v)$ be a discrete valued field with valuation ring $\mathcal{O}$ and let $\mathfrak{m}$ be the maximal ideal.…

Let $A$ be a central simple algebra over a number field $K$ with ring of integers $\mathcal{O}_K$, such that either the degree of the algebra $n \ge 3$, or $n=2$ and $A$ is not a totally definite quaternion algebra. Then strong…

In many online learning problems we are interested in predicting local information about some universe of items. For example, we may want to know whether two items are in the same cluster rather than computing an assignment of items to…

Let $R$ be a regular ring containing a field $k$. Let $\mathbf{x} = x_1, \ldots, x_r$ be a regular sequence in $R$ such that $R/(\mathbf{x})$ is a regular ring. Fix $m \geq 1$. Set $A_m = R/(\mathbf{x})^m$. We show that for any ideal $Q$ of…

Let $A$ be a regular ring containing a field $K$ of characteristic zero and let $R = A[X_1,\ldots, X_m]$. Consider $R$ as standard graded with $\deg A = 0$ and $\deg X_i = 1$ for all $i$. Let $G$ be a finite subgroup of $GL_m(A)$. Let $G$…

We describe the support of $F$-finite $F$-modules over polynomial rings $R$ of prime characteristic. Our description yields an algorithm to compute the support of such modules; the complexity of our algorithm is also analyzed. To the best…

We give an algorithm to decide whether an algebraic plane foliation F has a rational first integral and to compute it in the affirmative case. The algorithm runs whenever we assume the polyhedrality of the cone of curves of the surface…

Large Language Model (LLM)-based Automated Program Repair (APR) has shown strong potential on textual benchmarks, yet struggles in multimodal scenarios where bugs are reported with GUI screenshots. Existing methods typically convert images…