English
Related papers

Related papers: On the structure of finitely generated shift-invar…

200 papers

We find finite, reasonably small, generator sets of the coordinate rings of G-character varieties of finitely generated groups for all classical groups G. This result together with the method of Grobner basis gives an algorithm for…

Algebraic Geometry · Mathematics 2015-05-27 Adam S. Sikora

For the analysis of molecular processes, the estimation of time-scales, i.e., transition rates, is very important. Estimating the transition rates between molecular conformations is -- from a mathematical point of view -- an invariant…

Computational Physics · Physics 2020-11-26 Luca Donati , Martin Heida , Bettina G. Keller , Marcus Weber

We give an overview of the existing algorithms to compute nonunique factorization invariants in finitely generated monoids.

Commutative Algebra · Mathematics 2015-04-29 P. A. García-Sánchez

The structure of covariant instruments is studied and a general structure theorem is derived. A detailed characterization is given to covariant instruments in the case of an irreducible representation of a locally compact group.

Mathematical Physics · Physics 2009-10-16 Claudio Carmeli , Teiko Heinosaari , Alessandro Toigo

We define standardized constructions of finite fields, and standardized generators of (multiplicative) cyclic subgroups in these fields. The motivation is to provide a substitute for Conway polynomials which can be used by various software…

Commutative Algebra · Mathematics 2023-08-22 Frank Lübeck

By abstracting a connection between gauge symmetry and gauge identity on a noncommutative space, we analyse star (deformed) gauge transformations with usual Leibnitz rule as well as undeformed gauge transformations with a twisted Leibnitz…

High Energy Physics - Theory · Physics 2008-11-26 Rabin Banerjee , Saurav Samanta

Let G be an affine algebraic group acting on an affine variety X. We present an algorithm for computing generators of the invariant ring K[X]^G in the case where G is reductive. Furthermore, we address the case where G is connected and…

Commutative Algebra · Mathematics 2007-05-23 Harm Derksen , Gregor Kemper

This paper is devoted to proving a general invariant representation theorem for generators of general time interval backward stochastic differential equations, where the generator $g$ has a quadratic growth in the unknown variable $z$ and…

Probability · Mathematics 2021-11-12 Guangshuo Zhou , Fengjiao Du , Shengjun Fan

We define enumerative invariants associated to a hybrid Gauged Linear Sigma Model. We prove that in the relevant special cases, these invariants recover both the Gromov-Witten type invariants defined by Chang-Li and Fan-Jarvis-Ruan using…

Algebraic Geometry · Mathematics 2021-01-01 Ionut Ciocan-Fontanine , David Favero , Jérémy Guéré , Bumsig Kim , Mark Shoemaker

We represent closed subspaces of the Hardy space that are invariant under finite-rank perturbations of the backward shift. We apply this to classify almost invariant subspaces of the backward shift and represent a more refined version of…

Functional Analysis · Mathematics 2024-08-09 Soma Das , Jaydeb Sarkar

We study when a group of form $G\times\mathbb{Z}^m (m\geq 1)$ has the finitely generated fixed subgroup property of automorphisms ($\rm{FGFP}_a$), by using the BNS-invariant, and provide some partial answers and non-trivial examples.

Group Theory · Mathematics 2025-05-14 Jialin Lei , Jiming Ma , Qiang Zhang

A subset S of a group G invariably generates G if G = <s^(g(s)) | s in S> for each choice of g(s) in G, s in S. In this paper we study invariable generation of infinite groups, with emphasis on linear groups. Our main result shows that a…

Group Theory · Mathematics 2014-07-18 William M. Kantor , Alexander Lubotzky , Aner Shalev

Let $E(\mathscr{A})$ denote the shift-invariant space associated with a countable family $\mathscr{A}$ of functions in $L^{2}(\mathbb{H}^{n})$ with mutually orthogonal generators, where $\mathbb{H}^{n}$ denotes the Heisenberg group. The…

Functional Analysis · Mathematics 2017-11-27 R. Radha , Saswata Adhikari

We show that all permutations in $S_n$ can be generated by affine unicritical polynomials. We use the $\operatorname{PGL}$ group structure to compute the cycle structure of permutations with low Carlitz rank. The tree structure of the group…

Number Theory · Mathematics 2021-03-22 Anna Chlopecki , Juliano Levier-Gomes , Wayne Peng , Alex Shearer , Adam Towsley

An additive fast Fourier transform over a finite field of characteristic two efficiently evaluates polynomials at every element of an $\mathbb{F}_2$-linear subspace of the field. We view these transforms as performing a change of basis from…

Symbolic Computation · Computer Science 2018-07-23 Nicholas Coxon

Let $\mathcal G$ denote the space of finitely generated marked groups. For any finitely generated group $G$, we construct a continuous, injective map $f$ from the space of subgroups $Sub(G)$ to $\mathcal G$ that sends conjugate subgroups to…

Group Theory · Mathematics 2024-03-27 D. Osin

We give an algorithm allowing to construct bases of local unitary invariants of pure k-qubit states from the knowledge of polynomial covariants of the group of invertible local filtering operations. The simplest invariants obtained in this…

Quantum Physics · Physics 2013-02-12 Frederic Toumazet , Jean-Gabriel Luque , Jean-Yves Thibon

We prove that if $G$ is a finitely generated group and $Z$ is a uniformly recurrent subgroup of $G$ then there exists a minimal system $(X,G)$ with $Z$ as its stability system. This answers a query of Glasner and Weiss \cite{GW} in the case…

Dynamical Systems · Mathematics 2017-02-07 Gabor Elek

We propose the use of low bit-depth Sigma-Delta and distributed noise-shaping methods for quantizing the Random Fourier features (RFFs) associated with shift-invariant kernels. We prove that our quantized RFFs -- even in the case of $1$-bit…

Machine Learning · Computer Science 2022-04-14 Jinjie Zhang , Harish Kannan , Alexander Cloninger , Rayan Saab

An algorithm for irreducible decomposition of representations of finite groups over fields of characteristic zero is described. The algorithm uses the fact that the decomposition induces a partition of the invariant inner product into a…

Representation Theory · Mathematics 2019-06-05 Vladimir V Kornyak