English
Related papers

Related papers: Linear complexity problems of level sequences of E…

200 papers

Let $N, p \geq 5$ be primes such that $N \equiv 1 \bmod p$. We study the rank $r$ of the Hecke algebra that parametrizes modular forms of weight 2 and level $N$ that are Eisenstein modulo $p$. When $r$ is $2$ or $3$, we prove that $r-1$…

Number Theory · Mathematics 2026-05-07 Jaclyn Lang , Katharina Müller , Bharathwaj Palvannan

The main goal of this paper is to give a modular type representation for the infinite product $(1-x)(1-xq)(1-xq^2)(1-xq^3)...$. It is shown that this representation essentially contains the well-known modular formulae either for Dedekind's…

Number Theory · Mathematics 2011-12-22 Changgui Zhang

We use the ordinary Euler operator to compute the Ehrhart series for an arbitrary lattice polytope. The resulting formula involves the coefficients of the Ehrhart polynomial, combined via Eulerian numbers. We use this to compute $h^*_{d-1}$…

Combinatorics · Mathematics 2023-03-31 Wayne A. Johnson

Let $p>0$ be a prime, $k$ a field of characteristic $p$ and $G$ and elementary abelian $p$-group of order $q = p^n$. Let $W$ be an indecomposable $kG$-module of dimension 2 and define $V_i=S^{i-1}(W^*)$ for each $i=1 \ldots q$. We show that…

Representation Theory · Mathematics 2025-10-10 Jonathan Elmer , Kazal Kadr

Linear recursions of degree $k$ are determined by evaluating the sequence of Generalized Fibonacci Polynomials, $\{F_{k,n}(t_1,...,t_k)\}$ (isobaric reflects of the complete symmetric polynomials) at the integer vectors $(t_1,...,t_k)$. If…

Number Theory · Mathematics 2007-12-17 Trueman MacHenry , Kieh Wong

In this work we study global boundedness and exponential integrability of weak solutions to degenerate $p$-Poisson equations using an iterative method of De Giorgi type. Given a symmetric, non-negative definite matrix valued function $Q$…

Analysis of PDEs · Mathematics 2023-09-11 Sullivan Francis MacDonald , Scott Rodney

In this paper, we consider characterisations of the class of unitary matrix integrals $\big\langle (\det U)^q {\rm e}^{s^{1/2} \operatorname{Tr}(U + U^\dagger)} \big\rangle_{U(l)}$ in terms of a first-order matrix linear differential…

Mathematical Physics · Physics 2026-02-20 Peter J. Forrester , Fei Wei

In an underdetermined system of equations $Ax=y$, where $A$ is an $m\times n$ matrix, only $u$ of the entries of $y$ with $u < m$ are known. Thus $E_jw$, called `measurements', are known for certain $j\in J \subset \{0,1,\ldots,m-1\}$ where…

Information Theory · Computer Science 2020-04-14 Ted Hurley

Let f be a newform of weight at least 2 and squarefree level with Fourier coefficients in a number field K. We give explicit bounds, depending on congruences of f with other newforms, on the set of primes lambda of K for which the…

Number Theory · Mathematics 2007-05-23 Tom Weston

In this paper, the linear complexity over $\mathbf{GF}(r)$ of generalized cyclotomic quaternary sequences with period $2pq$ is determined, where $ r $ is an odd prime such that $r \ge 5$ and $r\notin \lbrace p,q\rbrace$. The minimal value…

Cryptography and Security · Computer Science 2016-03-01 Minglong Qi , Shengwu Xiong , Jingling Yuan , Wenbi Rao , Luo Zhong

In this work, Ramanujan type congruences modulo powers of primes $p \ge 5$ are derived for a general class of products that are modular forms of level $p$. These products are constructed in terms of Klein forms and subsume generating…

Number Theory · Mathematics 2024-03-26 Timothy Huber , Nathaniel Mayes , Jeffery Opoku , Dongxi Ye

We study the problem \begin{equation*} (I_{\epsilon}) \left\{\begin{aligned} -\Delta u- \frac{\mu u}{|x|^2}&=u^p -\epsilon u^q \quad\text{in }\quad \Omega, \\ u&>0 \quad\text{in }\quad \Omega, \\ u &\in H^1_0(\Omega)\cap L^{q+1}(\Omega),…

Analysis of PDEs · Mathematics 2019-02-05 Mousomi Bhakta , Sanjiban Santra

In this paper we study some nonlinear elliptic equations in $\R^n$ obtained as a perturbation of the problem with the fractional critical Sobolev exponent, that is $$ (-\Delta)^s u = \epsilon\,h\,u^q + u^p \ {{in}}\R^n,$$ where $s\in(0,1)$,…

Analysis of PDEs · Mathematics 2016-06-03 Serena Dipierro , Maria Medina , Ireneo Peral , Enrico Valdinoci

The evaluation of electrostatic energy for a set of point charges in a periodic lattice is a computationally expensive part of molecular dynamics simulations (and other applications) because of the long-range nature of the Coulomb…

Rueppel's conjecture on the linear complexity of the first $n$ terms of the sequence $(1,1,0,1,0^3,1,0^7,1,0^{15},\ldots)$ was first proved by Dai using the Euclidean algorithm. We have previously shown that we can attach a homogeneous…

Symbolic Computation · Computer Science 2023-05-02 Graham H. Norton

We propose a definition of an Euler characteristic for unbounded chain complexes by taking the (usual) Euler characteristics of successively longer parts of the complex, weighted inversely proportional to the length, and passing to the…

K-Theory and Homology · Mathematics 2026-04-16 Thomas Huettemann , Dan Kucerovsky

We study boundary value problems for semilinear elliptic equations of the form $-\Delta u+g\circ u=\mu$ in a smooth bounded domain $\Omega\subset R^N$. Let $\{\mu_n\}$ and $\{\tau_n\}$ be sequences of measure in $\Omega$ and $\partial…

Analysis of PDEs · Mathematics 2015-03-31 Mousomi Bhakta , Moshe Marcus

In this paper, we study some Euler-Ap\'ery-type series which involve central binomial coefficients and (generalized) harmonic numbers. In particular, we establish elegant explicit formulas of some series by iterated integrals and…

Number Theory · Mathematics 2019-10-22 Weiping Wang , Ce Xu

Mahler equations relate evaluations of the same function $f$ at iterated $b$th powers of the variable. They arise in particular in the study of automatic sequences and in the complexity analysis of divide-and-conquer algorithms. Recently,…

Symbolic Computation · Computer Science 2020-11-10 Frédéric Chyzak , Thomas Dreyfus , Philippe Dumas , Marc Mezzarobba

The complexity of a module is the rate of growth of the minimal projective resolution of the module while the $z$-complexity is the rate of growth of the number of indecomposable summands at each step in the resolution. Let…

Representation Theory · Mathematics 2017-03-21 Houssein El Turkey
‹ Prev 1 8 9 10 Next ›