Related papers: An algorithm for computing compatibly Frobenius sp…
We investigate the $\mathfrak{m}$-adic continuity of Frobenius splitting dimensions and ratios for divisor pairs $(R,\Delta)$ in an $F$-finite local ring $(R,\mathfrak{m},k)$ of prime characteristic $p>0$. Our main result states that if $R$…
Rings with Nakayama permutations, pseudo-Frobenius and Frobenius rings in particular, are studied by applying the general theory of formal matrix rings to their Peirce decompositions. A combinatorial criterion is given to decide whether a…
Importance sampling algorithms are discussed in detail, with an emphasis on implicit sampling, and applied to data assimilation via particle filters. Implicit sampling makes it possible to use the data to find high-probability samples at…
In this paper we present the notion of arithmetic variety for numerical semigroups. We study various aspects related to these varieties such as the smallest arithmetic that contains a set of numerical semigroups and we exhibit the root…
Using Buium's theory of arithmetic differential characters, we construct a filtered $F$-isocrystal ${\bf H}(A)_K$ associated to an abelian scheme $A$ over a $p$-adically complete discrete valuation ring with perfect residue field. As a…
Given a finite abelian group $G$ and elements $x, y \in G$, we prove that there exists $\phi \in \text{Aut}(G)$ such that $\phi(x) = y$ if and only if $G/\langle x \rangle \cong G/\langle y \rangle$. This result leads to our development of…
The symmetric Nonnegative Matrix Factorization (NMF), a special but important class of the general NMF, has found numerous applications in data analysis such as various clustering tasks. Unfortunately, designing fast algorithms for the…
We consider valued fields with a distinguished contractive map as valued modules over the Ore ring of difference operators. We prove quantifier elimination for separably closed valued fields with the Frobenius map, in the pure module…
The purpose of this work is to generalize part of the theory behind Faugere's "F5" algorithm. This is one of the fastest known algorithms to compute a Groebner basis of a polynomial ideal I generated by polynomials f_{1},...,f_{m}. A major…
In the 1960s Atkin discovered congruences modulo primes $\ell\leq 31$ for the partition function $p(n)$ in arithmetic progressions modulo $\ell Q^3$, where $Q\neq \ell$ is prime. Recent work of the first author with Allen and Tang shows…
We consider certain quotient algebras of tensor algebras of bimodules $M$ over a finite-dimensional algebra $R$, and we investigate Frobenius type properties of such algebras. Our main interest is in the case where $M=R^*$, the linear dual…
The split feasibility problem is to find an element in the intersection of a closed set $C$ and the linear preimage of another closed set $D$, assuming the projections onto $C$ and $D$ are easy to compute. This class of problems arises…
The common behaviour of many families of numerical semigroups led up to defining, firstly, the Frobenius varieties and, secondly, the (Frobenius) pseudo-varieties. However, some interesting families are still out of these definitions. To…
Using the theory of spherical varieties and especially Frobenius splitting results for symmetric varieties, we give a type independent very short proof of Wahl's conjecture for cominuscule homogeneous spaces for all primes different from 2.
Let $R$ be a graded commutative ring with non-zero unity $1$ and $M$ be a graded unitary $R$-module. Let $GS(M)$ be the set of all graded $R$-submodules of $M$ and $\phi: GS(M)\rightarrow GS(M)\bigcup\{\emptyset\}$ be a function. A proper…
We study a splitting of the Frobenius map on the whole algebra of distributions of SL_2 (over a finite field) and its relation with the explicit Frobenius descent on arithmetic D-modules over the projective line
Given a family of rational curves depending on a real parameter, defined by its parametric equations, we provide an algorithm to compute a finite partition of the parameter space (${\Bbb R}$, in general) so that the shape of the family…
We investigate computational issues in the distributed model Amoebots of programmable matter. In this model, the computational entities, called particles, are anonymous finite-state machines that operate and move on an hexagonal tasselation…
Let $\V$ be a mixed characteristic complete discrete valuation ring, let $\X$ and $\Y$ be two smooth formal $\V$-schemes, let $f_0$ : $X \to Y$ be a projective morphism between their special fibers, let $T$ be a divisor of $Y$ such that…
In this paper, we focus on computing the kernel of a map of polynomial rings $\varphi$. This core problem in symbolic computation is known as implicitization. While there are extremely effective Gr\"obner basis methods used to solve this…