相关论文: A construction of (t,s)-sequences with finite-row …

For any prime power $q$ and any dimension $s$, a new construction of $(t,s)$-sequences in base $q$ using global function fields is presented. The construction yields an analog of Halton sequences for global function fields. It is the first…

The authors recently introduced so-called Vandermonde nets. These digital nets share properties with the well-known polynomial lattices. For example, both can be constructed via component-by-component search algorithms. A striking…

Let $\F_q$ be a finite field of characteristic $p>0$. We prove that, given $F(t,x)\in \F_q[t][x]$ an irreducible separable monic polynomial in the variable $x$ and a generic monic polynomial $\phi(t)$ in the variable $t$, the polynomial…

In their recent paper, Rosen, Takeyama, Tasaka, and Yamamoto constructed recurrent sequences providing a decomposition law of primes in a Galois extension. In this paper, we reconstruct their sequences via representation theory of finite…

We study generalized splines from the perspective of the representation theory of the category of graphs with contractions. Our main theorem proves a kind of finite generation, which in turn implies the existence of a ``universal generating…

This paper presents a novel approach to constructing finite generating sets for infinitely generated ideals. By integrating algebraic and computational techniques, we provide a method to identify finite generators, demonstrated through…

Score-based generative models (SGMs) are generative models that are in the spotlight these days. Time-series frequently occurs in our daily life, e.g., stock data, climate data, and so on. Especially, time-series forecasting and…

In this article we survey recent results on the explicit construction of finite point sets and infinite sequences with optimal order of $\mathcal{L}_q$ discrepancy. In 1954 Roth proved a lower bound for the $\mathcal{L}_2$ discrepancy of…

We derive generalized generating functions for basic hypergeometric orthogonal polynomials by applying connection relations with one free parameter to them. In particular, we generalize generating functions for the Askey-Wilson, continuous…

Score-based generative models (SGMs) have demonstrated unparalleled sampling quality and diversity in numerous fields, such as image generation, voice synthesis, and tabular data synthesis, etc. Inspired by those outstanding results, we…

Uniform asymptotic formulae for arrays of complex numbers of the form $(f_{r,s})$, with $r$ and $s$ nonnegative integers, are provided as $r$ and $s$ converge to infinity at a comparable rate. Our analysis is restricted to the case in which…

In coding theory, constructing codes with good parameters is one of the most important and fundamental problems. Though a great many of good codes have been produced, most of them are defined over alphabets of sizes equal to prime powers.…

This paper investigates the theoretical behavior of generative models under finite training populations. Within the stochastic interpolation generative framework, we derive closed-form expressions for the optimal velocity field and score…

We obtain new uniform upper bounds for the (non necessarily symmetric) tensor rank of the multiplication in the extensions of the finite fields $\F_q$ for any prime or prime power $q\geq2$; moreover these uniform bounds lead to new…

Sequences that are defined by multisums of hypergeometric terms with compact support occur frequently in enumeration problems of combinatorics, algebraic geometry and perturbative quantum field theory. The standard recipe to study the…

An $(r, s)$-formation is a concatenation of $s$ permutations of $r$ letters. If $u$ is a sequence with $r$ distinct letters, then let $\mathit{Ex}(u, n)$ be the maximum length of any $r$-sparse sequence with $n$ distinct letters which has…

It is well known that constructing codes with good parameters is one of the most important and fundamental problems in coding theory. Though a great many of good codes have been produced, most of them are defined over alphabets of sizes…

We construct new linear codes with high minimum distance d. In at least 12 cases these codes improve the minimum distance of the previously known best linear codes for fixed parameters n,k. Among these new codes there is an optimal ternary…

Inspired by the works of L. Carlitz and Z.-W. Sun on cyclotomic matrices, in this paper, we investigate certain cyclotomic matrices involving Gauss sums over finite fields, which can be viewed as finite field analogues of certain matrices…

Consider the power pseudorandom-number generator in a finite field ${\mathbb F}_q$. That is, for some integer $e\ge2$, one considers the sequence $u,u^e,u^{e^2},\dots$ in ${\mathbb F}_q$ for a given seed $u\in {\mathbb F}_q^\times$. This…