相关论文: A Generalized Numeration Base
Motivated by coding applications,two enumeration problems are considered: the number of distinct divisors of a degree-m polynomial over F = GF(q), and the number of ways a polynomial can be written as a product of two polynomials of degree…
This work formalizes efficient Fast Fourier-based multiplication algorithms for polynomials in quotient rings such as $\mathbb{Z}_{m}[x]/\left<x^{n}-a\right>$, with $n$ a power of 2 and $m$ a non necessarily prime integer. We also present a…
By jagged partitions we refer to an ordered collection of non-negative integers $(n_1,n_2,..., n_m)$ with $n_m\geq p$ for some positive integer $p$, further subject to some weakly decreasing conditions that prevent them for being genuine…
The generalized winding number function measures insideness for arbitrary oriented triangle meshes. Exploiting this, I similarly generalize binary boolean operations to act on such meshes. The resulting operations for union, intersection,…
Riordan matrices are infinite lower triangular matrices corresponding to the certain operators in the space of formal power series. Generalized Euler polynomials ${{g}_{n}}\left( x \right)={{\left( 1-x…
We consider the set of power functions defined on the set of positive real number, and their linear combinations. After recalling some properties of the gamma function, we give two general definitions of derivatives of positive and negative…
In this paper, we consider representations of integers as sums of generalized heptagonal numbers with a prescribed number of repeats of each heptagonal number appearing in the sum. In particular, we investigate the classification of such…
We give a survey of the foundations of statistical queries and their many applications to other areas. We introduce the model, give the main definitions, and we explore the fundamental theory statistical queries and how how it connects to…
Let S be a surface of genus g with n points removed, G a connected Lie group, and X(G) the moduli space of representations of the fundamental group of S into G. We compute the fundamental group of X(G) when n>0 and G is a real or complex…
An elementary approach is shown which derives the values of the Gauss sums over $\mathbb F_{p^r}$, $p$ odd, of a cubic character without using Davenport-Hasse's theorem. New links between Gauss sums over different field extensions are shown…
Interacting systems of particles with generalized statistics are considered on both classical and quantum level. It is shown that all possible quantum states and corresponding processes can be represented in terms of certain specific…
Two correspondences have been provided that associate any linear code over a finite field with a binomial ideal. In this paper, algorithms for computing their Graver bases and universal Gr\"obner bases are given. To this end, a connection…
For a finite group $G$ and positive integer $g$, a $g$-additive basis is a subset of $G$ whose pairwise sums cover each element of $G$ at least $g$ times, with $g$-difference bases defined similarly using pairwise differences. While prior…
In addition to rather complicated general methods it is interesting and valuable to develop fast efficient methods for calculating generators of power integral bases in special types of number fields. We consider sextic fields containing a…
We study sets of integers that can be defined by the vanishing of a generalised polynomial expression. We show that this includes sets of values of linear recurrent sequences of Salem type and some linear recurrent sequences of Pisot type.…
We introduce categories of weak factorization algebras and factorization spaces, and prove that they are equivalent to the categories of ordinary factorization algebras and spaces, respectively. This allows us to define the pullback of a…
In this work we present a new class of numerical semigroups called GSI-semigroups. We see the relations between them and others families of semigroups and we give explicitly their set of gaps. Moreover, an algorithm to obtain all the…
We examine the representation of numbers as the sum of two squares in $\mathbb{Z}_n$ for a general positive integer $n$. Using this information we make some comments about the density of positive integers which can be represented as the sum…
We shall generalize the notion of a Laver table to algebras which may have many generators, several fundamental operations, fundamental operations of arity higher than 2, and to algebras where only some of the operations are…
In this paper some new ways of generalizing perfect numbers are investigated, numerical results are presented and some conjectures are established.