English
Related papers

Related papers: Solutions of the matrix equation $p(X)=A$, with po…

200 papers

We deal with the following nonlinear problem involving fractional $p\&q$ Laplacians: \begin{equation*} (-\Delta)^{s}_{p}u+(-\Delta)^{s}_{q}u+|u|^{p-2}u+|u|^{q-2}u=\lambda h(x) f(u)+|u|^{q^{*}_{s}-2}u \mbox{ in } \mathbb{R}^{N},…

Analysis of PDEs · Mathematics 2019-07-02 Vincenzo Ambrosio

We consider the problem of enumerating hypermatrices of format $2 \times (k + 1) \times k$ over a finite field that have nonzero hyperdeterminant and whose nonzero entries are restricted to a plane partition. We conjecture an attractive…

Combinatorics · Mathematics 2026-02-26 Brandon Koprowski , Joel Brewster Lewis

The Hilbert class polynomial $H_{\mathcal{O}}(x)\in \mathbb{Z}[x]$ attached to an order $\mathcal{O}$ in an imaginary quadratic field $K$ is the monic polynomial whose roots are precisely the distinct $j$-invariants of elliptic curves over…

Number Theory · Mathematics 2022-02-14 Mingjie Chen , Jiangwei Xue

By applying Fourier transformations to the natural orthogonal oscillator representations of special linear Lie algebras, Luo and the second author (2013) obtained a large family of infinite-dimensional irreducible representations of the…

Representation Theory · Mathematics 2025-01-20 Hengjia Zhang , Xiaoping Xu

We introduce a new non-degeneracy condition at infinity for a real or a mixed polynomial mapping $F$ which allows us to approximate its bifurcation locus in terms of certain Newton polyhedra. We derive a sufficiency result for the Jacobian…

Algebraic Geometry · Mathematics 2014-03-07 Y. Chen , L. R. G. Dias , M. Tibar

We give sufficient conditions for the existence and uniqueness, in bounded uniformly convex domains $\Omega$, of solutions of degenerate elliptic equations depending also on the nonlinear gradient term $H$, in term of the size of $\Omega$,…

Analysis of PDEs · Mathematics 2020-04-16 I. Birindelli , G. Galise , A. Rodríguez

Given an order, a commutative ring whose additive group is free of finite rank, a natural computational question is whether a fixed univariate polynomial $f \in \mathbb{Z}[X]$ has a root in this ring. In this paper, we show that the…

Rings and Algebras · Mathematics 2025-07-01 Pim Spelier

We classify all solutions (p,q) to the equation p(u)q(u)=p(u+b)q(u+a) where p and q are complex polynomials in one indeterminate u, and a and b are fixed but arbitrary complex numbers. This equation is a special case of a system of…

Rings and Algebras · Mathematics 2020-06-09 Jonas T. Hartwig , Daniele Rosso

We establish necessary and sufficient conditions for a quadratic polynomial to be irreducible in the ring $Z[[x]]$ of formal power series with integer coefficients. For $n,m\ge 1$ and $p$ prime, we show that $p^n+p^m\beta x+\alpha x^2$ is…

Commutative Algebra · Mathematics 2023-10-24 Daniel Birmajer , Juan Gil , Michael Weiner

Let $p$ be a prime, let $d \geq 1$ be an integer and $A$ be the algebra of square matrices of size $d$ over the field of order $p$. Let $P, Q \in A[x_1, \dots x_n]$ be polynomials in $n$ indeterminates with coefficients in $A$, such that…

Combinatorics · Mathematics 2026-05-22 Pierre-Emmanuel Caprace , Justin Vast

With no criteria of the index type, it is proved the existence of a solution for the Riemann-Hilbert problem in the fairly general setting of arbitrary Jordan domains, measurable coefficients and measurable boundary data. The theorem is…

Complex Variables · Mathematics 2014-02-12 Vladimir Ryazanov

A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…

Number Theory · Mathematics 2017-11-16 Jonathan Hickman , James Wright

Any satisfiability problem in conjunctive normal form can be solved in polynomial time by reducing it to a 3-sat formulation and transforming this to a Linear Complementarity problem (LCP) which is then solved as a linear program (LP). Any…

Computational Complexity · Computer Science 2018-01-31 Giacomo Patrizi

The problem of expressing a multivariate polynomial as the determinant of a monic (definite) symmetric or Hermitian linear matrix polynomial (LMP) has drawn a huge amount of attention due to its connection with optimization problems. In…

Optimization and Control · Mathematics 2017-01-12 Papri Dey , Harish K. Pillai

We address complexity issues for linear differential equations in characteristic $p>0$: resolution and computation of the $p$-curvature. For these tasks, our main focus is on algorithms whose complexity behaves well with respect to $p$. We…

Symbolic Computation · Computer Science 2009-01-27 Alin Bostan , Éric Schost

We argue that reducing nonlinear programming problems to a simple canonical form is an effective way to analyze them, specially when the problem is degenerate and the usual linear independence hypothesis does not hold. To illustrate this…

Optimization and Control · Mathematics 2018-04-02 Walter F. Mascarenhas

We consider the problem of reconstruction of an $n\times n$ matrix with coefficients depending rationally on $x\in \mathbb P^1$ from the data of: (a) its characteristic polynomial and (b) a line bundle of degree $g+n-1$, with $g$ the…

Mathematical Physics · Physics 2025-12-16 Marco Bertola

Let $\mathbb{F}_q$ be a finite field with $q=p^n$ elements. In this paper, we study the number of solutions of equations of the form $a_1 x_1^{d_1}+\dots+a_s x_s^{d_s}=b$ with $x_i\in\mathbb{F}_{p^{t_i}}$, where $b\in\mathbb{F}_q$ and…

Number Theory · Mathematics 2021-02-23 José Alves Oliveira

In this paper, we study nonlinear differential equations of Tumura-Clunie type, $ f^n + P(z, f) = h, $ where \( n \geq 2 \) is an integer, \( P(z, f) \) is a differential polynomial in \( f \) of degree \( \gamma_P \leq n - 1 \) with small…

Complex Variables · Mathematics 2025-05-21 Mohamed Amine Zemirni , Zinelaabidine Latreuch

In this paper, we study the hardness of solving graph-structured linear systems with coefficients over a finite field $\mathbb{Z}_p$ and over a polynomial ring $\mathbb{F}[x_1,\ldots,x_t]$. We reduce solving general linear systems in…

Data Structures and Algorithms · Computer Science 2022-11-09 Jingbang Chen , Yu Gao , Yufan Huang , Richard Peng , Runze Wang
‹ Prev 1 8 9 10 Next ›