Related papers: An algorithm for computing compatibly Frobenius sp…
This paper is the first of a series in which we develop exact and approximate algorithms for mappings of systems of differential equations. Here we introduce the MapDE algorithm and its implementation in Maple, for mappings relating…
Commutative Hilbertian Frobenius algebras are those commutative semi-group objects in the monoidal category of Hilbert spaces, for which the Hilbert adjoint of the multiplication satisfies the Frobenius compatibility relation, that is, this…
In this paper, we introduce a family of hyper-elliptic curves. For this family we compute the matrix of the divided Frobenius and we obtain general formulas. We use a recent results of Huyghe-Wach : the divided Frobenius coincides with the…
This paper is about sheaf cohomology for varieties (schemes) in characteristic $p>0$. We assume the presence of a Frobenius splitting. (See V.B. Mehta and A. Ramanathan, Frobenius splitting and cohomology vanishing for Schubert varieties,…
We classify abelian subgroups of Out(F_n) up to finite index in an algorithmic and computationally friendly way. A process called disintegration is used to canonically decompose a single rotationless element \phi into a composition of…
We consider random variables of the form $F=f(V_1,...,V_n)$, where $f$ is a smooth function and $V_i,i\in\mathbb{N}$, are random variables with absolutely continuous law $p_i(y) dy$. We assume that $p_i$, $i=1,...,n$, are piecewise…
Consider the problem of efficiently evaluating isogenies $\phi: E \to E/H$ of elliptic curves over a finite field $\mathbb{F}_q$, where the kernel $H = \langle G\rangle$ is a cyclic group of odd (prime) order: given $E$, $G$, and a point…
We present a new algorithm, Fractional Decomposition Tree (FDT) for finding a feasible solution for an integer program (IP) where all variables are binary. FDT runs in polynomial time and is guaranteed to find a feasible integer solution…
We introduce a new invariant for local rings of prime characteristic, called Frobenius complexity, that measures the abundance of Frobenius actions on the injective hull of the residue field of a local ring. We present an important case…
If $X$ is Frobenius split, then so is its normalization and we explore conditions which imply the converse. To do this, we recall that given an $\mathcal{O}_X$-linear map $\phi : F_* \mathcal{O}_X \to \mathcal{O}_X$, it always extends to a…
Assume that $X$ is an affine toric variety of characteristic $p > 0$. Let $\Delta$ be an effective toric $Q$-divisor such that $K_X+\Delta$ is $Q$-Cartier with index not divisible by $p$ and let $\phi_{\Delta}:F^e_* O_X \to O_X$ be the…
In this paper we study the computational feasibility of an algorithm to prove orbifold equivalence between potentials describing Landau-Ginzburg models. Through a comparison with leading results of Groebner basis computations in cryptology,…
The paper shows that if the set of associated primes of Frobenius powers of ideals or a closely related set of primes is finite then if tight closure does not commute with localisation one can find a counter-example where $R$ is complete…
The purpose of this note is to relate certain ring-theoretic properties of rings in mixed and positive characteristics that are related to each other by a tilting operation used in perfectoid geometry. To this aim, we exploit the…
Let $G$ be a simply connected and simple algebraic group defined and split over a finite prime field $\mathbb{F}_p$ of $p$ elements. In this paper, using an $\mathbb{F}_p$-linear map splitting Frobenius endomorphism on a hyperalgebra…
The goal of this paper is to construct a Frobenius splitting on $G/U$ via the Poisson geometry of $(G/U,\pi_{G/U})$, where $G$ is a semi-simple algebraic group of classical type defined over an algebraically closed field of characteristic…
Let $R$ be the homogeneous coordinate ring of the Grassmannian $\mathbb{G}=Gr(2,n)$ defined over an algebraically closed field $k$ of characteristic $p \geq \max\{n-2,3\}$. In this paper we give a description of the decomposition of $R$,…
The goal of this paper is to introduce a new constructive geometric proof of the affine version of Chevalley's Theorem. This proof is algorithmic and a verbatim implementation resulted in an efficient code for computing the constructible…
In his 1984 Memoir of the American Mathematical Society, George Andrews defined two families of functions, $\phi_k(n)$ and $c\phi_k(n),$ which enumerate two types of combinatorial objects which Andrews called generalized Frobenius…
We present a systematic, algebraically based, design methodology for efficient implementation of computer programs optimized over multiple levels of the processor/memory and network hierarchy. Using a common formalism to describe the…