Related papers: On Rueppel's Linear Complexity Conjecture

The Weitzenboeck theorem states that the algebra of constants of a linear locally nilpotent derivation of the polynomial algebra K[Z]=K[z_1,...,z_m] in m variables over a field K of characteristic 0 is finitely generated. If m=2n and the…

This paper verifies $n\times 1$ Local Converse Theorem for twisted gamma factors of irreducible cuspidal representations of ${\rm GL}_n({\mathbb F}_p)$, for $n\leq 5,$ and of irreducible generic representations, for…

In this paper we introduce the notion of linear computability as a method of finding the Waring rank of forms. We use this notion to find infinitely many new examples which satisfy Strassen's Conjecture.

Dorpalen-Barry et al. proved Elser's conjecture about sign of Elser's number by interpreting them as certain sums of reduced Euler characteristics of an abstract simplicial complex known as $U$-nucleus complex. We prove a conjecture posed…

LREC= is an extension of first-order logic with a logarithmic recursion operator. It was introduced by Grohe et al. and shown to capture the complexity class L over trees and interval graphs. It does not capture L in general as it is…

Linear predictors form a rich class of hypotheses used in a variety of learning algorithms. We present a tight analysis of the empirical Rademacher complexity of the family of linear hypothesis classes with weight vectors bounded in…

In 1933, Rado conjectured that for any positive integer n, there is always a linear homogeneous equation with degree of regularity n. In proving this conjecture, Alexeev and Tsimerman, and independently Golowich, found that some equations…

Let $\text{E}/\text{F}$ be a quadratic extension of non-Archimedean local fields with odd residual characteristic. In this paper, we give equivalent conditions for a simple supercuspidal representation $\pi$ of $\text{GL}(n, \text{E})$ to…

We extend the Duffin--Schaeffer conjecture to the setting of systems of $m$ linear forms in $n$ variables. That is, we establish a criterion to determine whether, for a given rate of approximation, almost all or almost no $n$-by-$m$ systems…

Let $b,n\in \mathbb{Z}$, $n\geq 1$, and ${\cal D}_1, \ldots, {\cal D}_{\tau(n)}$ be all positive divisors of $n$. For $1\leq l \leq \tau(n)$, define ${\cal C}_l:=\lbrace 1 \leqslant x\leqslant n \; : \; (x,n)={\cal D}_l\rbrace$. In this…

We introduce Reeb complexes in order to capture how generators of homology flow along sections of a real valued continuous function. This intuition suggests a close relation of Reeb complexes to established methods in topological data…

We study multidimensional configurations (infinite words) and subshifts of low pattern complexity using tools of algebraic geometry. We express the configuration as a multivariate formal power series over integers and investigate the setup…

We introduce hardness in relative entropy, a new notion of hardness for search problems which on the one hand is satisfied by all one-way functions and on the other hand implies both next-block pseudoentropy and inaccessible entropy, two…

We propose new algorithms for the computation of the first N terms of a vector (resp. a basis) of power series solutions of a linear system of differential equations at an ordinary point, using a number of arithmetic operations which is…

By generalizing Gessel-Xin's Laurent series method for proving the Zeilberger-Bressoud $q$-Dyson Theorem, we establish a family of $q$-Dyson style constant term identities. These identities give explicit formulas for certain coefficients of…

Direct links between generalized harmonic numbers, linear Euler sums and Tornheim double series are established in a more perspicuous manner than is found in existing literature. We show that every linear Euler sum can be decomposed into a…

Typing of lambda-terms in Elementary and Light Affine Logic (EAL, LAL, resp.) has been studied for two different reasons: on the one hand the evaluation of typed terms using LAL (EAL, resp.) proof-nets admits a guaranteed polynomial…

We formulate and analyze several finiteness conjectures for linear algebraic groups over higher-dimensional fields. In fact, we prove all of these conjectures for algebraic tori as well as in some other situations. This work relies in an…

Orthogonality is a fundamental theme in representation theory and Fourier analysis. An orthogonality relation for characters of finite abelian groups (now recognized as an orthogonality relation on GL(1)) was used by Dirichlet to prove…

We consider the periods of the linear congruential and the power generators modulo $n$ and, for fixed choices of initial parameters, give lower bounds that hold for ``most'' $n$ when $n$ ranges over three different sets: the set of primes,…