Related papers: On Rueppel's Linear Complexity Conjecture

In this paper, we prove Lusztig's conjecture for finite special linear groups, i.e., we show that characteristic functions of character sheaves coincide with almost characters up to scalar constants, under the condition that the…

In 1882, Kronecker established that a given univariate formal Laurent series over a field can be expressed as a fraction of two univariate polynomials if and only if the coefficients of the series satisfy a linear recurrence relation. We…

We present new descriptive complexity characterisations of classes REG (regular languages), LCFL (linear context-free languages) and CFL (context-free languages) as restrictions on inference rules, size of formulae and permitted connectives…

We relate the computational complexity of finite strings to universal representations of their underlying symmetries. First, Boolean functions are classified using the universal covering topologies of the circuits which enumerate them. A…

Consider a real matrix $\Theta$ consisting of rows $(\theta_{i,1},\ldots,\theta_{i,n})$, for $1\leq i\leq m$. The problem of making the system linear forms $x_{1}\theta_{i,1}+\cdots+x_{n}\theta_{i,n}-y_{i}$ for integers $x_{j},y_{i}$ small…

In this note further clue decisive observations on cobweb admissible sequences are shared with the audience. In particular an announced proof of the Theorem 1 (by Dziemia\'nczuk) from [1] announced in India -Kolkata- December 2007 is…

Let $N$ be a fixed positive integer, and let $f\in S_k(N)$ be a primitive cusp form given by the Fourier expansion $f(z)=\sum_{n=1}^{\infty} \lambda_f(n)n^{\frac{k-1}{2}}e(nz)$. We consider the partial sum $S(x,f)=\sum_{n\leq…

Given a first-order theory $T$ formulated in the usual language of first-order arithmetic, we say that $T$ is of *restricted complexity* if there is some natural number $n$ and some set $\mathcal A$ of $\Sigma_n$-sentences such that $T$ can…

Let $(U_n)_{n\geq 0}$ be a fixed linear recurrence sequence of integers with order at least two, and for any positive integer $\ell$, let $\ell \cdot 2^{\ell} + 1$ be a Cullen number. Recently in \cite{bmt}, generalized Cullen numbers in…

Recently Raayoni et al. announced various conjectures on continued fractions of fundamental constants automatically generated with machine learning techniques. In this paper we prove some of their stated conjectures for Euler number $e$ and…

Using Popa's deformation/rigidity theory, we investigate prime decompositions of von Neumann algebras of the form $L(\mathcal{R})$ for countable probability measure preserving equivalence relations $\mathcal{R}$. We show that…

This paper presents a first result of a long term research project dealing with the construction of d-orthogonal polynomials with Hahn's property. We shall show that the latter class could be characterized by expanding a polynomial as a…

The Local Converse Problem is to determine how the family of the local gamma factors $\gamma(s,\pi\times\tau,\psi)$ characterizes the isomorphism class of an irreducible admissible generic representation $\pi$ of $\mathrm{GL}_n(F)$, with…

We study the problem of generating interesting integer sequences with a combinatorial interpretation. For this we introduce a two-step approach. In the first step, we generate first-order logic sentences which define some combinatorial…

Consider a homogeneous polynomial $p(z_1,...,z_n)$ of degree $n$ in $n$ complex variables . Assume that this polynomial satisfies the property : \\ $|p(z_1,...,z_n)| \geq \prod_{1 \leq i \leq n} Re(z_i)$ on the domain $\{(z_1,...,z_n) :…

We consider representing of natural numbers by expressions using 1's, addition, multiplication and parentheses. $\left\| n \right\|$ denotes the minimum number of 1's in the expressions representing $n$. The logarithmic complexity $\left\|…

We prove that every triconnected planar graph is definable by a first order sentence that uses at most 15 variables and has quantifier depth at most $11\log_2 n+43$. As a consequence, a canonic form of such graphs is computable in $AC^1$ by…

Using the structure of Singer cycles in general linear groups, we prove that a conjecture of Zeng, Han and He (2007) holds in the affirmative in a special case, and outline a plausible approach to prove it in the general case. This…

We present algorithms to factorize weighted homogeneous elements in the first polynomial Weyl algebra and $q$-Weyl algebra, which are both viewed as a $\mathbb{Z}$-graded rings. We show, that factorization of homogeneous polynomials can be…

The random $2$-dimensional simplicial complex process starts with a complete graph on $n$ vertices, and in every step a new $2$-dimensional face, chosen uniformly at random, is added. We prove that with probability tending to $1$ as…