English
Related papers

Related papers: Computations of generating lengths with GAP

200 papers

We propose a class of generating functions denoted by $\textrm{RGF}_p(x)$, which is related to the Sylvester denumerant for the quotients of numerical semigroups. Using MacMahon's partition analysis, we can obtain $\textrm{RGF}_p(x)$ by…

Combinatorics · Mathematics 2024-11-27 Feihu Liu

We describe the generic modules in each component of the spaces of representations of certain string algebras. In so doing, we calculate the dimensions of higher self-extension groups for generic modules. This algorithm lends itself for use…

Representation Theory · Mathematics 2011-11-23 Andrew Thomas Carroll

We obtain new explicit pseudorandom generators for several computational models involving groups. Our main results are as follows: 1. We consider read-once group-products over a finite group $G$, i.e., tests of the form $\prod_{i=1}^n…

Computational Complexity · Computer Science 2025-06-05 Chin Ho Lee , Emanuele Viola

Freyd's generating hypothesis for the stable module category of a non-trivial finite group G is the statement that a map between finitely generated kG-modules that belongs to the thick subcategory generated by k factors through a projective…

Representation Theory · Mathematics 2009-12-03 Jon F. Carlson , Sunil K. Chebolu , Jan Minac

Let $p\geq 5$ be a prime. We construct modular Galois representations for which the $\mathbb{Z}_p$-corank of the $p$-primary Selmer group (i.e., $\lambda$-invariant) over the cyclotomic $\mathbb{Z}_p$-extension is large. More precisely, for…

Number Theory · Mathematics 2024-04-12 Anwesh Ray

Using the link between mod $p$ Galois representations of $\qu$ and mod $p$ modular forms established by Serre's Conjecture, we compute, for every prime $p\leq 1999$, a lower bound for the number of isomorphism classes of continuous Galois…

Number Theory · Mathematics 2010-08-13 Tommaso Giorgio Centeleghe

We study exactness of groups and establish a characterization of exact groups in terms of the existence of a continuous linear operator, called an invariant expectation, whose properties make it a weak counterpart of an invariant mean on a…

Functional Analysis · Mathematics 2011-08-09 Ronald G. Douglas , Piotr W. Nowak

We establish a form of the Gotzmann representation of the Hilbert polynomial based on rank and generating degrees of a module, which allow for a generalization of Gotzmann's Regularity Theorem. Under an additional assumption on the…

Algebraic Geometry · Mathematics 2015-11-25 Roger Dellaca

The aim of this thesis is to determine classes of NP relations for which random generation and approximate counting problems admit an efficient solution. Since efficient rank implies efficient random generation, we first investigate some…

Computational Complexity · Computer Science 2010-12-15 Massimo Santini

A general Mackey type decomposition for representations of semisimple Hopf algebras is investigated. We show that such a decomposition occurs in the case that the module is induced from an arbitrary Hopf subalgebra and it is restricted back…

Quantum Algebra · Mathematics 2013-08-14 Sebastian Burciu

For a prime number p, we construct a generating set for the ring of invariants for the p+1 dimensional indecomposable modular representation of a cyclic group of order p^2. We then use the constructed invariants to describe the…

Commutative Algebra · Mathematics 2007-06-13 R. J. Shank , D. L. Wehlau

Let $c_n$ denote the number of nodes at a distance $n$ from the root of a rooted tree. A criterion for proving the rationality and computing the rational generating function of the sequence $\{c_n\}$ is described. This criterion is applied…

Combinatorics · Mathematics 2014-07-22 Amritanshu Prasad

We initiate the study of computable presentations of real and complex C*-algebras under the program of effective metric structure theory. With the group situation as a model, we develop corresponding notions of recursive presentations and…

Logic · Mathematics 2023-04-17 Alec Fox

In this paper, we propose generative probabilistic models for label aggregation. We use Gibbs sampling and a novel variational inference algorithm to perform the posterior inference. Empirical results show that our methods consistently…

Artificial Intelligence · Computer Science 2017-10-04 Chi Hong

Let G be a group and let A be the algebra of complex functions on G with finite support. The product in G gives rise to a coproduct on A making it a multiplier Hopf algebra. In fact, because there exist integrals, we get an algebraic…

Rings and Algebras · Mathematics 2010-02-22 L. Delvaux , A. Van Daele

Complex computer codes are often too time expensive to be directly used to perform uncertainty, sensitivity, optimization and robustness analyses. A widely accepted method to circumvent this problem consists in replacing cpu-time expensive…

Statistics Theory · Mathematics 2017-04-25 Bertrand Iooss , Amandine Marrel

We provide a framework connecting several well known theories related to the linearity of graded modules over graded algebras. In the first part, we pay a particular attention to the tensor products of graded bimodules over graded algebras.…

K-Theory and Homology · Mathematics 2017-09-27 Eduardo Marcos , Andrea Solotar , Yury Volkov

We show that the Galois cohomology groups of $p$-adic representations of a direct power of $\operatorname{Gal}(\overline{\mathbb{Q}_p}/\mathbb{Q}_p)$ can be computed via the generalization of Herr's complex to multivariable…

Number Theory · Mathematics 2019-03-18 Aprameyo Pal , Gergely Zábrádi

Here we initiate a program to study relationships between finite groups and arithmetic-geometric invariants in a systematic way. To do this we first introduce a notion of optimal module for a finite group in the setting of holomorphic mock…

Representation Theory · Mathematics 2023-03-14 Miranda C. N. Cheng , John F. R. Duncan , Michael H. Mertens

The problem of computing modulo prime-power sums is investigated in distributed source coding as well as computation over Multiple-Access Channel (MAC). We build upon group codes and present a new class of codes called Quasi Group Codes…

Information Theory · Computer Science 2016-11-17 Mohsen Heidari , S. Sandeep Pradhan
‹ Prev 1 4 5 6 7 8 10 Next ›