Related papers: Noncommutative Involutive Bases
Given a local ring containing a field, we define and investigate a family of invariants that includes the Lyubeznik numbers, but that captures finer information. These "generalized Lyubeznik numbers" are defined as lengths of certain…
The main purpose of this paper is to develop new algorithms for computing invariant rings in a general setting. This includes invariants of nonreductive groups but also of groups acting on algebras over certain rings. In particular, we…
In order to study certain algebraic objects, and notably algebraic groups, Serre introduced the notion on invariants, in particular cohomological invariants. The construction of non-trivial cohomological invariants of algebraic groups is an…
These introductory notes are about functional renormalization group equations and some of their applications. It is emphasised that the applicability of this method extends well beyond critical systems, it actually provides us a general…
The conventional spectral mapping theorem for quantum walks can only be applied for walks employing a shift operator whose square is the identity. This theorem gives most of the eigenvalues of the time evolution $U$ by lifting the…
The present work is inspired by three interrelated themes: Weingarten calculus for integration over unitary groups, monotone Hurwitz numbers which enumerate certain factorisations of permutations into transpositions, and Jucys-Murphy…
Let J be a strongly stable monomial ideal in P=k[X0,...,Xn] and let BSt(J) be the family of all the homogeneous ideals in P such that the set N(J) of all the monomials that do not belong to J is a k-vector basis of the quotient P/I. We show…
One studies a particular algebraic system where the unknowns are matrices. We solve this system according to the parameters values thanks to the theory of Grobner basis.
In this contribution, we consider a zero-dimensional polynomial system in $n$ variables defined over a field $\mathbb{K}$. In the context of computing a Rational Univariate Representation (RUR) of its solutions, we address the problem of…
A quantum walk places a traverser into a superposition of both graph location and traversal "spin." The walk is defined by an initial condition, an evolution determined by a unitary coin/shift-operator, and a measurement based on the…
We give new and explicitly computable examples of Gibbs-non-Gibbs transitions of mean-field type, using the large deviation approach introduced in [4]. These examples include Brownian motion with small variance and related diffusion…
Dotsenko and Vallette discovered an extension to nonsymmetric operads of Buchberger's algorithm for Gr\"obner bases of polynomial ideals. In the free nonsymmetric operad with one ternary operation $({\ast}{\ast}{\ast})$, we compute a…
We consider a discrete-time quantum walk, called the Grover walk, on a distance regular graph $X$. Given that $X$ has diameter $d$ and invertible adjacency matrix, we show that the square of the transition matrix of the Grover walk on $X$…
Computing partition function is the most important statistical inference task arising in applications of Graphical Models (GM). Since it is computationally intractable, approximate methods have been used to resolve the issue in practice,…
Noncommutative invariant theory is a generalization of the classical invariant theory of the action of $SL(2,\IC)$ on binary forms. The dimensions of the spaces of invariant noncommutative polynomials coincide with the numbers of certain…
The main theme of this dissertation is retooling methods to work for different situations. I have taken the method derived by O'Hara and simplified by Zeilberger to prove unimodality of $q$-binomials and tweaked it. This allows us to create…
Grokking has been actively explored to reveal the mystery of delayed generalization and identifying interpretable representations and algorithms inside the grokked models is a suggestive hint to understanding its mechanism. Grokking on…
In this paper, an original reduction algorithm for solving simultaneous multivariate polynomial equations is presented. The algorithm is exponential in complexity, but the well-known algorithms, such as the extended Euclidean algorithm and…
Signature-based algorithms have become a standard approach for Gr\"obner basis computations for polynomial systems over fields, but how to extend these techniques to coefficients in general rings is not yet as well understood. In this…
We introduce a broader class of nonassociative Ore extensions that unifies and generalizes several earlier constructions. We prove generalizations of Hilbert's Basis Theorem for this class, showing that they arise immediately from the…