English
Related papers

Related papers: An algorithm for computing compatibly Frobenius sp…

200 papers

This paper presents an algorithm for calculation of the Lyubeznik numbers of a local ring which is a homomorphic image of a regular local ring $R$ of prime characteristic. The methods used employ Lyubeznik's $F$-modules over $R$,…

Commutative Algebra · Mathematics 2022-04-06 Mordechai Katzman , Rodney Y. Sharp

The separability assumption (Donoho & Stodden, 2003; Arora et al., 2012) turns non-negative matrix factorization (NMF) into a tractable problem. Recently, a new class of provably-correct NMF algorithms have emerged under this assumption. In…

Machine Learning · Statistics 2012-10-04 Abhishek Kumar , Vikas Sindhwani , Prabhanjan Kambadur

Let $K$ be a field equipped with a valuation. Tropical varieties over $K$ can be defined with a theory of Gr\"obner bases taking into account the valuation of $K$. Because of the use of the valuation, this theory is promising for stable…

Symbolic Computation · Computer Science 2015-09-30 Tristan Vaccon

Let $R$ be a commutative chain ring. We use a variation of Gr\"obner bases to study the lattice of ideals of $R[x]$. Let $I$ be a proper ideal of $R[x]$. We are interested in the following two questions: When is $R[x]/I$ Frobenius? When is…

Commutative Algebra · Mathematics 2013-08-06 Xiang-dong Hou

The behavior of the Frobenius map is investigated for valuation rings of prime characteristic. We show that valuation rings are always F-pure. We introduce a generalization of the notion of strong F-regularity, which we call F-pure…

Commutative Algebra · Mathematics 2016-12-30 Rankeya Datta , Karen E. Smith

Following the program of algebraic Frobenius splitting begun by Kumar and Littelmann, we use representation-theoretic techniques to construct a Frobenius splitting of the cotangent bundle of the flag variety of a semisimple algebraic group…

Representation Theory · Mathematics 2012-12-18 Chuck Hague

An excellent ring of prime characteristic for which the Frobenius map is pure is also Frobenius split in many commonly occurring situations in positive characteristic commutative algebra and algebraic geometry. However, using a fundamental…

Commutative Algebra · Mathematics 2024-06-18 Rankeya Datta , Takumi Murayama

In this paper we derive and analyze an algorithm for inverting quaternion matrices. The algorithm is an analogue of the Frobenius algorithm for the complex matrix inversion. On the theory side, we prove that our algorithm is more efficient…

Numerical Analysis · Mathematics 2023-05-05 Qiyuan Chen , J. Uhlmann , Ke Ye

We study the inversion analog of the well-known Gauss algorithm for multiplying complex matrices. A simple version is $(A + iB)^{-1} = (A + BA^{-1}B)^{-1} - i A^{-1}B(A+BA^{-1} B)^{-1}$ when $A$ is invertible, which may be traced back to…

Numerical Analysis · Mathematics 2023-10-10 Zhen Dai , Lek-Heng Lim , Ke Ye

We begin by showing that any $n \times n$ matrix can be decomposed into a sum of $n$ circulant matrices with periodic relaxations on the unit circle. This decomposition is orthogonal with respect to a Frobenius inner product, allowing…

Numerical Analysis · Mathematics 2022-09-29 Hariprasad M. , Murugesan Venkatapathi

Fix any field $K$ of characteristic $p$ such that $[K:K^p]$ is finite. We discuss excellence for Noetherian domains whose fraction field is $K$, showing for example, that $R$ is excellent if and only if the Frobenius map is finite on $R$.…

Commutative Algebra · Mathematics 2018-01-22 Rankeya Datta , Karen E. Smith

The purpose of this paper is to describe several applications of finiteness properties of $F$-finite $F$-modules recently discovered by M. Hochster to the study of Frobenius maps on injective hulls, Frobenius near-splittings and to the…

Commutative Algebra · Mathematics 2011-02-04 Mordechai Katzman

A new algorithm to approximate Hermitian matrices by positive semidefinite Hermitian matrices based on modified Cholesky decompositions is presented. In contrast to existing algorithms, this algorithm allows to specify bounds on the…

Numerical Analysis · Mathematics 2019-12-12 Joscha Reimer

For $k$ a perfect field of characteristic $p>0$ and $G/k$ a split reductive group with $p$ a non-torsion prime for $G,$ we compute the mod $p$ motivic cohomology of the geometric classifying space $BG_{(r)}$, where $G_{(r)}$ is the $r$th…

Algebraic Geometry · Mathematics 2022-12-21 Eric Primozic

Frobenius splitting, pioneered by Hochster and Roberts in the 1970s and Mehta and Ramanathan in the 1980s, is a technique in characteristic $p$ commutative algebra and algebraic geometry used to control singularities. In the aughts, Knutson…

Commutative Algebra · Mathematics 2025-09-05 Emanuela De Negri , Elisa Gorla , Patricia Klein , Jenna Rajchgot , Lisa Seccia

Let $R$ be a commutative ring with non-zero identity and $M$ be a unitary $R$-module. Let $\mathcal{S}(M)$ be the set of all submodules of $M$, and $\phi:\mathcal{S}(M)\to \mathcal{S}(M)\cup \{\emptyset\}$ be a function. We say that a…

Commutative Algebra · Mathematics 2009-07-27 Naser Zamani

We extend the notion of Frobenius Betti numbers and F-splitting ratio to large classes of finitely generated modules over rings of prime characteristic, which are not assumed to be local. We also prove that the strong F-regularity of a pair…

Commutative Algebra · Mathematics 2018-11-28 Alessandro De Stefani , Thomas Polstra , Yongwei Yao

Schwede proved very recently in arXiv:0901.1154 that in a quasiprojective scheme X with a fixed Frobenius splitting, there are only finitely many subschemes {Y} that are compatibly split. (A simpler proof has already since been given in…

Algebraic Geometry · Mathematics 2009-01-16 Allen Knutson

Suppose $R$ is a $\mathbb{Q}$-Gorenstein $F$-finite and $F$-pure ring of prime characteristic $p>0$. We show that if $I\subseteq R$ is a compatible ideal (with all $p^{-e}$-linear maps) then there exists a module finite extension $R\to S$…

Commutative Algebra · Mathematics 2022-11-08 Thomas Polstra , Karl Schwede

The famous F5 algorithm for computing Gr\"obner basis was presented by Faug\`ere in 2002 without complete proofs for its correctness. The current authors have simplified the original F5 algorithm into an F5 algorithm in Buchberger's style…

Symbolic Computation · Computer Science 2010-07-01 Yao Sun , Dingkang Wang