Related papers: An algorithm for computing compatibly Frobenius sp…

We propose a definition of computable manifold by introducing computability as a structure that we impose to a given topological manifold, just in the same way as differentiability or piecewise linearity are defined for smooth and PL…

Partitioning is a well studied research problem in the area of VLSI physical design automation. In this problem, input is an integrated circuit and output is a set of almost equal disjoint blocks. The main objective of partitioning is to…

Over a Noetherian, local ring R of prime characteristic p, the Frobenius functor F induces a diagonalizable map on certain quotients of rational Grothendieck groups. This leads to an explicit formula for the Dutta multiplicity, and it is…

If $X$ is a smooth scheme over a perfect field of characteristic $p$, and if $\sD_X$ is the sheaf of differential operators on $X$ [EGAIV], it is well known that giving an action of $\sD_X$ on an $\sO_X$-module $\sE$ is equivalent to giving…

Let A \subseteq B be cancellative abelian semigroups, and let R be an integral domain. We show that the semigroup ring R[B] can be decomposed, as an R[A]-module, into a direct sum of R[A]-submodules of the quotient ring of R[A]. In the case…

This is a survey of Frobenius splitting techniques in commutative algebra, based on the first author's lectures at the introductory workshop for the special year in commutative algebra at MSRI in fall 2012.

Constrained maximization of submodular functions poses a central problem in combinatorial optimization. In many realistic scenarios, a number of agents need to maximize multiple submodular objectives over the same ground set. We study such…

Recursive algorithms for computing the Frobenius norm of a real array are proposed, based on hypot, a hypotenuse function. Comparing their relative accuracy bounds with those of the BLAS routine DNRM2 it is shown that the proposed…

We show that the bigroupoid of separable symmetric Frobenius algebras over an algebraically closed field and the bigroupoid of finitely semi-simple Calabi-Yau categories are equivalent. To this end, we construct a trace on the category of…

A standard method for finding a rational number from its values modulo a collection of primes is to determine its value modulo the product of the primes via Chinese remaindering, and then use Farey sequences for rational reconstruction.…

Strict linear feasibility or linear separation is usually tackled using efficient approximation/stochastic algorithms (that may even run in sub-linear times in expectation). However, today state of the art for solving…

We introduce differential primary decompositions for ideals in a commutative ring. Ideal membership is characterized by differential conditions. The minimal number of conditions needed is the arithmetic multiplicity. Minimal differential…

We give two algorithmic procedures to compute the whole set of almost symmetric numerical semigroups with fixed Frobenius number and type, and the whole set of almost symmetric numerical semigroups with fixed Frobenius number. Our…

Orthogonalization is one of few mathematical methods conforming to mathematical standards for approximation. Finding a consistent PC matrix of a given an inconsistent PC matrix is the main goal of a pairwise comparisons method. We introduce…

We investigate the partitioning of partial orders into a minimal number of heapable subsets. We prove a characterization result reminiscent of the proof of Dilworth's theorem, which yields as a byproduct a flow-based algorithm for computing…

We prove the existence and give constructions of a $(p(k)-1)$-fold perfect resolvable $(v, k, 1)$-Mendelsohn design for any integers $v > k \ge 2$ with $v \equiv 1 \mod k$ such that there exists a finite Frobenius group whose kernel $K$ has…

In this note we relate the property of a semisimple l-adic Galois representation being "F-split" for a number field F to its having abelian image. By F-split we mean that the characteristic polynomials of Frobenii all split in F.

In this paper we develop an axiomatic setup for algorithmic homological algebra of Abelian categories. This is done by exhibiting all existential quantifiers entering the definition of an Abelian category, which for the sake of…

Motivated by the problems of computing sample covariance matrices, and of transforming a collection of vectors to a basis where they are sparse, we present a simple algorithm that computes an approximation of the product of two n-by-n real…

We prove that in positive characteristic a module with good filtration for a group of type E6 restricts to a module with good filtration for a subgroup of type F4. (Recall that a filtration of a module for a semisimple algebraic group is…