Results 51 to 60 of about 94,460 (146)
PRIMES REPRESENTED BY INCOMPLETE NORM FORMS
Forum of Mathematics, Pi, 2020 Let $K=\mathbb{Q}(\unicode[STIX]{x1D714})$ with $\unicode[STIX]{x1D714}$ the root of a degree $n$ monic irreducible polynomial $f\in \mathbb{Z}[X]$. We show that the degree $n$ polynomial $N(\sum _{i=1}^{n-k}x_{i}\unicode[STIX]{x1D714}^{i-1})$ in $n-k ...
JAMES MAYNARD
doaj +1 more source
Okutsu invariants and Newton polygons
, 2010 Let K be a local field of characteristic zero, O its ring of integers and F(x) a monic irreducible polynomial with coefficients in O. K. Okutsu attached to F(x) certain primitive divisor polynomials F_1(x),..., F_r(x), that are specially close to F(x ...
Guardia, Jordi +2 more
core +1 more source
Markov Determinantal Point Process for Dynamic Random Sets
Journal of Time Series Analysis, EarlyView.ABSTRACT The Law of Determinantal Point Process (LDPP) is a flexible parametric family of distributions over random sets defined on a finite state space, or equivalently over multivariate binary variables. The aim of this paper is to introduce Markov processes of random sets within the LDPP framework. We show that, when the pairwise distribution of two
Christian Gouriéroux, Yang Lu
wiley +1 more source
Counting integral matrices with a given characteristic polynomial [PDF]
, 2000 We give a simpler proof of an earlier result giving an asymptotic estimate for the number of integral matrices, in large balls, with a given monic integral irreducible polynomial as their common characteristic polynomial. The proof uses equidistributions
Shah, Nimish A.
core +1 more source
On computing local monodromy and the numerical local irreducible decomposition
Transactions of the London Mathematical Society, Volume 13, Issue 1, December 2026.Abstract Similarly to the global case, the local structure of a holomorphic subvariety at a given point is described by its local irreducible decomposition. Geometrically, the key requirement for obtaining a local irreducible decomposition is to compute the local monodromy action of a generic linear projection at the given point, which is always well ...
Parker B. Edwards +1 more
wiley +1 more source
The complexity of computing Kronecker coefficients [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 Kronecker coefficients are the multiplicities in the tensor product decomposition of two irreducible representations of the symmetric group $S_n$. They can also be interpreted as the coefficients of the expansion of the internal product of two Schur ...
Peter Bürgisser, Christian Ikenmeyer
doaj +1 more source
Asymptotic Behavior of a Surface Implicitly Defined
Mathematics, 2022 In this paper, we introduce the notion of infinity branches and approaching surfaces. We obtain an algorithm that compares the behavior at the infinity of two given algebraic surfaces that are defined by an irreducible polynomial.
Elena Campo-Montalvo +2 more
doaj +1 more source
The set of stable primes for polynomial sequences with large Galois group
, 2017 Let $K$ be a number field with ring of integers $\mathcal O_K$, and let $\{f_k\}_{k\in \mathbb N}\subseteq \mathcal O_K[x]$ be a sequence of monic polynomials such that for every $n\in \mathbb N$, the composition $f^{(n)}=f_1\circ f_2\circ\ldots\circ f_n$
Ferraguti, Andrea
core +1 more source
The 3‐sparsity of Xn−1$X^n-1$ over finite fields of characteristic 2
Transactions of the London Mathematical Society, Volume 13, Issue 1, December 2026.Abstract Let q$q$ be a prime power and Fq$\mathbb {F}_q$ the finite field with q$q$ elements. For a positive integer n$n$, the polynomial Xn−1∈Fq[X]$X^n - 1 \in \mathbb {F}_q[X]$ is termed 3‐sparse over Fq$\mathbb {F}_q$ if all its irreducible factors in Fq[X]$\mathbb {F}_q[X]$ are either binomials or trinomials.
Kaimin Cheng
wiley +1 more source
Irreducibility of generalized Fibonacci polynomials
, 2022 Two ...
Flórez, Rigoberto, Saunders, J. C.
openaire +3 more sources