English
Related papers

Related papers: On Rueppel's Linear Complexity Conjecture

200 papers

We prove that the Arithmetic Fundamental Lemma conjecture of Wei Zhang is equivalent to a similar conjecture, but for Lie algebras, in the case of non-degenerate intersection. We use this result to give a simplified proof of the AFL for…

Algebraic Geometry · Mathematics 2015-02-11 Andreas Mihatsch

In this paper, we study a combinatorial problem originating in the following conjecture of Erdos and Lemke: given any sequence of n divisors of n, repetitions being allowed, there exists a subsequence the elements of which are summing to n.…

Combinatorics · Mathematics 2012-08-14 Benjamin Girard

In a recent paper, Bilu et al. studied a conjecture of Marques and Lengyel on the $p$-adic valuation of the Tribonacci sequence. In this article, we study the $p$-adic valuation of third order linear recurrence sequences by considering a…

Number Theory · Mathematics 2024-10-17 Deepa Antony , Rupam Barman

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 $\mathrm{GL}(1)$) was used by Dirichlet to…

Number Theory · Mathematics 2021-05-26 Dorian Goldfeld , Eric Stade , Michael Woodbury , Bingrong Huang

Shmuel Friedland and Giorgio Ottaviani's beautiful constant term expression for the number of singular vector tuples of generic tensors is used to derive a rational generating function for these numbers, that in turn, is used to obtain an…

Combinatorics · Mathematics 2016-05-03 Shalosh B. Ekhad , Doron Zeilberger

Recently the problem of constructing a perfect Euler cuboid was related with three conjectures asserting the irreducibility of some certain three polynomials depending on integer parameters. In this paper a partial result toward proving the…

Number Theory · Mathematics 2011-09-13 Ruslan Sharipov

We introduce the Double leaves basis, a combinatorial basis for the Hom spaces between two Bott-Samelson-Soergel bimodules. As an application we give a combinatorial algorithm to find, for any given Weyl or affine Weyl group, the set of…

Representation Theory · Mathematics 2020-07-06 Nicolas Libedinsky

We prove some combinatorial conjectures extending those proposed in [13, 14]. The proof uses a vertex operator due to Nekrasov, Okounkov, and the first author [4] to obtain a "gluing formula" for the relevant generating series, essentially…

Algebraic Geometry · Mathematics 2016-03-31 Erik Carlsson , Fernando Rodriguez-Villegas

We unify Linear Algebra by proposing a definition of determinants via one equation that implies all known properties of them:\\ 1. Cramer's Rule,\\ 2. Cofactor expansion,\\ 3. Antisymmetry of determinants,\\ 4. Linearity of determinants,\\…

Geometric Topology · Mathematics 2023-06-05 Jerzy Dydak

Schenck and Seceleanu proved that if $R = k[x,y,z]$, where $k$ is an infinite field, and $I$ is an ideal generated by any collection of powers of linear forms, then multiplication by a general linear form $L$ induces a homomorphism of…

Commutative Algebra · Mathematics 2016-11-15 Juan Migliore , Rosa María Miró-Roig

We prove a recent conjecture due to Deutsch, Sagan, and Wilson stating that the finite sequence obtained from the first p central trinomial coefficients modulo p by replacing nonzero terms by 1's is palindromic, for any prime number p > 3.…

Number Theory · Mathematics 2007-05-23 Jean-Paul Allouche

We propose a single-step non-generational conjecture of all first class constraints,(involving only variables compatible with canonical Poisson brackets), for a realistic gauge singular field theory. We verify our proposal for the free…

Mathematical Physics · Physics 2009-10-03 K. Rasem Qandalji

There is a longstanding conjecture by Fr\"oberg about the Hilbert series of the ring $R/I$, where $R$ is a polynomial ring, and $I$ an ideal generated by generic forms. We prove this conjecture true in the case when $I$ is generated by a…

Commutative Algebra · Mathematics 2017-11-13 Lisa Nicklasson

Computing the Euler genus of a graph is a fundamental problem in graph theory and topology. It has been shown to be NP-hard by [Thomassen '89] and a linear-time fixed-parameter algorithm has been obtained by [Mohar '99]. Despite extensive…

Data Structures and Algorithms · Computer Science 2014-12-05 Ken-ichi Kawarabayashi , Anastasios Sidiropoulos

The concept of I-statistical convergence of sequence was first defined by Das et.al [2]. In this paper we introduce and study the notion of rough I-statistical convergence of sequence in normed linear Spaces. We also define the set of rough…

Functional Analysis · Mathematics 2018-09-19 Prasanta Malik , Manojit Maity , Argha Ghosh

In this paper, we use a variety of classical and new research methods for ternary exponential Diophantine equations and extensive use of computer calculations to study the conjecture of R. Scott and R. Styer which asserts that for any fixed…

Number Theory · Mathematics 2026-04-22 Takafumi Miyazaki , Reese Scott , Robert Styer

We prove the conjecture by Feigin, Fuchs and Gelfand describing the Lie algebra cohomology of formal vector fields on an $n$-dimensional space with coefficients in symmetric powers of the coadjoint representation. We also compute the…

K-Theory and Homology · Mathematics 2017-02-16 Anton Khoroshkin

Suppose we are given an $n$-dimensional order-3 symmetric tensor $T \in (\mathbb{R}^n)^{\otimes 3}$ that is the sum of $r$ random rank-1 terms. The problem of recovering the rank-1 components is possible in principle when $r \lesssim n^2$…

Computational Complexity · Computer Science 2023-03-28 Alexander S. Wein

A simple integration by parts and telescopic cancellation leads to a rigorous derivation of the first 2 terms for the error in Ramanujan's asymptotic series for the nth partial sum of the harmonic series. Then Kummer's transformation gives…

Classical Analysis and ODEs · Mathematics 2007-05-23 Mark B. Villarino

In this article we show how to generalize to the Darbouxian, Liouvillian and Riccati case the extactic curve introduced by J. Pereira. With this approach, we get new algorithms for computing, if it exists, a rational, Darbouxian,…

Symbolic Computation · Computer Science 2018-12-20 Guillaume Chèze , Thierry Combot