Related papers: Computationally easy, spectrally good multipliers …
Bundling crossings is a strategy which can enhance the readability of drawings. In this paper we consider good drawings, i.e., we require that any two edges have at most one common point which can be a common vertex or a crossing. Our main…
We classify the irreducible representations of smooth, connected affine algebraic groups over a field, by tackling the case of pseudo-reductive groups. We reduce the problem of calculating the dimension for pseudo-split pseudo-reductive…
We compute the quark number susceptibilities in two flavor QCD for staggered fermions by adding the chemical potential as a Lagrange multiplier for the point-split number density term. Since lesser number of quark propagators are required…
Pseudo-random number generators are widely used in many branches of science, mainly in applications related to Monte Carlo methods, although they are deterministic in design and, therefore, unsuitable for tackling fundamental problems in…
We prove an $L^p$-spectral multiplier theorem under the sharp regularity condition $s > d\left|1/p - 1/2\right|$ for sub-Laplacians on M\'etivier groups. The proof is based on a restriction type estimate which, at first sight, seems to be…
A new method for parallel generation of $q$-valued pseudorandom sequence based on the presentation of systems generating logical formulae by means of arithmetic polynomials is proposed. Fragment consisting of $k$-elements of $q$-valued…
Let p1, p2,..., pn be distinct prime numbers, and let Nn be their product. We prove that, for any positive integer L that is divisible by the least common multiple of p1 minus one, p2 minus one, and so on, and for integers a1, a2,..., an…
Based on cyclic simplex codes, a new construction of a family of 2-generator quasi-cyclic two-weight codes is given. New optimal binary quasi-cyclic [195, 8, 96], [210, 8, 104] and [240, 8, 120] codes, good QC ternary [195, 6, 126], [208,…
Several musical scales, like the major scale, can be described as finite arithmetic sequences modulo octave, i.e. chunks of an arithmetic sequence in a cyclic group. Hence the question of how many different arithmetic sequences in a cyclic…
The ever-increasing need for random numbers is clear in many areas of computer science, from neural networks to optimization. As such, most common programming language provide easy access to Pseudorandom Number Generators. However, these…
In quasi-Monte Carlo methods, generating high-dimensional low discrepancy sequences by generator matrices is a popular and efficient approach. Historically, constructing or finding such generator matrices has been a hard problem. In…
We compare the implementation of a 8x8 bit multiplier with two different implementations of a 4x4 quaternary digit multiplier. Interfacing this binary multiplier with quaternary to binary decoders and binary to quaternary encoders leads to…
Thick GEM-like (THGEM) gaseous electron multipliers are made of standard printed-circuit board perforated with sub-millimeter diameter holes, etched at their rims. Effective gas multiplication factors of 100000 and 10000000 and fast pulses…
We describe an algorithm for computing successive quotients of the Schur multiplier $M(G)$ for a group $G$ given by an invariant finite $L$-presentation. As application, we investigate the Schur multipliers of various self-similar groups…
Let $G$ be a commutative algebraic group embedded in projective space and $\Gamma$ a finitely generated subgroup of $G$. From these data we construct a chain of algebraic subgroups of $G$ which is intimately related to obstructions to…
Many generating series of combinatorially interesting numbers have the property that the sum of the terms of order $<p$ at some suitable point is congruent to a zero of a zeta-function modulo infinitely many primes $p$. Surprisingly, very…
In this paper, we prove the existence of an efficient algorithm for the computation of $q$-expansions of modular forms of weight $k$ and level $\Gamma$, where $\Gamma \subseteq SL_{2}({\mathbb{Z}})$ is an arbitrary congruence subgroup. We…
We study graded rings of modular forms over congruence subgroups, with coefficients in a subring $A$ of $\mathbb{C}$, and specifically the highest weight needed to generate these rings as $A$-algebras. In particular, we determine upper…
In this short communication we show how the Lie algebra $\mathfrak{g}_2$ can easily be described as a free Lie algebra on 3 generators, subject to some simple quadruple relations for these generators.
Consider a subfield of the field of rational functions in several indeterminates. We present an algorithm that, given a set of generators of such a subfield, finds a simple generating set. We provide an implementation of the algorithm and…