English
Related papers

Related papers: A Generalization of Euler's Criterion to Composite…

200 papers

We will prove several congruences modulo a power of a prime such as $$ \sum_{0<k_1<...<k_{n}<p}\leg{p-k_{n}}{3} {(-1)^{k_{n}}\over k_1... k_{n}}\equiv {lll} -{2^{n+1}+2\over 6^{n+1}} p B_{p-n-1}({1\over 3}) &\pmod{p^2} &{if $n$ is odd}…

Number Theory · Mathematics 2009-11-06 Roberto Tauraso

A cohomological criterion for the complete reducibility of modules of finite length satisfying a composability condition for a meromorphic open-string vertex algebra $V$ has been given by Qi and the author. In order to apply this criterion,…

Quantum Algebra · Mathematics 2018-09-26 Yi-Zhi Huang

It is well known that the multiplier ideal $\multr{I}$ of an ideal $I$ determines in a straightforward way the multiplier ideal $\multr{f}$ of a sufficiently general element $f$ of $I$. We give an explicit condition on a polynomial $f \in…

Algebraic Geometry · Mathematics 2007-05-23 Jason Howald

In this paper we establish the Eulers criterion of order l (a prime) when the ring of integers in the cyclotomic extension of Q of order l is a PID. Conditions are obtained in terms of Jacobi sums of order l.

Number Theory · Mathematics 2018-07-25 Jagmohan Tanti

We show that Wilson's theorem as well as the Wilson quotient can be described by supercongruences modulo any higher prime power involving terms of power sums of Fermat quotients. The new approach uses Bell polynomials and Newton's…

Number Theory · Mathematics 2025-09-08 Bernd C. Kellner

Assuming the Generalized Riemann Hypothesis, we prove the following: If b is an integer greater than one, then the multiplicative order of b modulo N is larger than N^(1-\epsilon) for all N in a density one subset of the integers. If A is a…

Number Theory · Mathematics 2015-06-26 P. Kurlberg

It is well known that ascents, descents and plateaux are equidistributed over the set of classical Stirling permutations. Their common enumerative polynomials are the second-order Eulerian polynomials, which have been extensively studied by…

Combinatorics · Mathematics 2025-06-27 Shi-Mei Ma , Jun-Ying Liu , Jean Yeh , Yeong-Nan Yeh

Computing modular coincidences can show whether a given substitution system, which is supported on a point lattice in R^d, consists of model sets or not. We prove the computatibility of this problem and determine an upper bound for the…

Metric Geometry · Mathematics 2008-03-11 D. Frettlöh , B. Sing

An algorithm to generate a minimal comprehensive Gr\"obner\, basis of a parametric polynomial system from an arbitrary faithful comprehensive Gr\"obner\, system is presented. A basis of a parametric polynomial ideal is a comprehensive…

Symbolic Computation · Computer Science 2020-03-19 Deepak Kapur , Yiming Yang

In this paper, we provide a necessary and sufficient condition ensuring the property of exponential dichotomy for periodic linear systems of generalized differential equations. This condition allow us to revisit a recent result of…

Classical Analysis and ODEs · Mathematics 2022-08-26 Claudio A. Gallegos , Gonzalo Robledo

A general structure theorem on higher order invariants is proven. For an arithmetic group, the structure of the corresponding Hecke module is determined. It is shown that the module does not contain any irreducible submodule. This explains…

Number Theory · Mathematics 2017-09-04 Anton Deitmar

E30 in the Enestrom index. Translated from the Latin original "De formis radicum aequationum cuiusque ordinis coniectatio" (1733). For an equation of degree n, Euler wants to define a "resolvent equation" of degree n-1 whose roots are…

History and Overview · Mathematics 2008-06-12 Leonhard Euler

The Euler numbers have been widely studied. A signed version of the Euler numbers of even subscript are given by the coefficients of the exponential generating function 1/(1+x^2/2!+x^4/4!+...). Leeming and MacLeod introduced a…

Number Theory · Mathematics 2025-01-15 Bruce E. Sagan

The Euler characteristic of a very affine variety encodes the number of critical points of the likelihood equation on this variety. In this paper, we study the Euler characteristic of the complement of a hypersurface arrangement with…

Algebraic Geometry · Mathematics 2024-12-31 Bernhard Reinke , Kexin Wang

In this paper we give Kummer's original type congruence relation modulo a prime power for the universal Bernoulli numbers. Although the index of the power is half of original congruence, this estimate is best possible.

Number Theory · Mathematics 2007-05-23 Yoshihiro Ônishi

We establish necessary and sufficient conditions for the existence of an LU factorization $A=LU$ for an arbitrary square matrix $A$, including singular and rank-deficient cases, without the use of row or column permutations. We prove that…

Numerical Analysis · Mathematics 2026-01-13 Eric Darve

In this paper, we will present several new congruences involving binomial coefficients under integer moduli, which are the continuation of the previous two work by Cai \textit{et al.} (2002, 2007).

Number Theory · Mathematics 2016-04-05 Hao Zhong , Shane Chern , Tianxin Cai

Congruence families, i.e., $\ell$-adic convergence for well-defined arithmetic subsequences, is a commonplace phenomenon for the coefficients of modular forms. Such families superficially resemble one another, but they often vary…

Number Theory · Mathematics 2024-03-19 Nicolas Allen Smoot

Let $S=K[x_1,\ldots,x_n]$ be the polynomial ring over a field and $A$ a standard graded $S$-algebra. In terms of the Gr\"obner basis of the defining ideal $J$ of $A$ we give a condition, called the x-condition, which implies that all graded…

Commutative Algebra · Mathematics 2020-10-23 Jürgen Herzog , Takayuki Hibi , Somayeh Moradi

A polynomial is expansive if all of its roots lie outside the unit circle. We define some special determinants involving the coefficients of a real polynomial and formulate necessary and sufficient conditions for expansivity using these…

Number Theory · Mathematics 2020-11-09 M. J. Uray