English
Related papers

Related papers: On cubic equations over $P-$adic field

200 papers

This paper proposes new quadratic constraints (QCs) to bound a quadratic polynomial. Such QCs can be used in dissipation ineqaulities to analyze the stability and performance of nonlinear systems with quadratic vector fields. The proposed…

Dynamical Systems · Mathematics 2022-09-09 Shih-Chi Liao , Maziar S. Hemati , Peter Seiler

The exact solutions of both the cubic Duffing equation and cubic-quintic Duffing equation are presented by using only leaf functions. In previous studies, exact solutions of the cubic Duffing equation have been proposed using functions that…

General Mathematics · Mathematics 2021-06-29 Kazunori Shinohara

In this paper, we describe the set of all solutions of monomial equation $x^k=a$ over $\mathbb Q_p$. Moreover, as an application of the result, we study several perturbations of the considered equation over $p$-adic field.

Number Theory · Mathematics 2020-06-24 Farrukh Mukhamedov , Otabek Khakimov

The discrete formulation of adiabatic quantum computing is compared with other search methods, classical and quantum, for random satisfiability (SAT) problems. With the number of steps growing only as the cube of the number of variables,…

Quantum Physics · Physics 2009-11-07 Tad Hogg

Let $p\equiv1\pmod3$ be a prime . We study several topics on additive decompositions concerning the set $C_p$ of all non-zero cubes in the finite field of $p$ elements. For example, we show that when $p>184291$ , the set $C_p$ has no…

Number Theory · Mathematics 2022-03-17 Hai-Liang Wu , Yue-Feng She

We investigate the irreducible cuspidal $C$-representations of a reductive $p$-adic group $G$ over a field $C$ of characteristic different from $p$. When $C$ is algebraically closed, for many groups $G$, a list of cuspidal $C$-types…

Number Theory · Mathematics 2022-08-31 Guy Henniart , Marie-France Vignéras

This article concerns a class of elliptic equations on Carnot groups depending on one real positive parameter and involving a subcritical nonlinearity (for the critical case we refer to G. Molica Bisci and D. Repov\v{s}, Yamabe-type…

Analysis of PDEs · Mathematics 2017-06-21 Massimiliano Ferrara , Giovanni Molica Bisci , Dušan Repovš

We prove that bounded weak solutions to degenerate parabolic double-phase equations of $p$-Laplace type are locally H\"older continuous. The proof is based on phase analysis and methods for the $p$-Laplace equation. In particular, the phase…

Analysis of PDEs · Mathematics 2025-02-04 Wontae Kim , Kristian Moring , Lauri Särkiö

In this article we give an algorithm for the computation of the number of rational points on the Jacobian variety of a generic ordinary hyperelliptic curve defined over a finite field of cardinality $q$ with time complexity $O(n^{2+o(1)})$…

Number Theory · Mathematics 2008-06-27 Robert Carls , David Lubicz

The solution of linear systems of equations is the basis of many other quantum algorithms, and recent results provided an algorithm with optimal scaling in both the condition number $\kappa$ and the allowable error $\epsilon$ [PRX Quantum…

Quantum Physics · Physics 2025-10-22 Pedro C. S. Costa , Dong An , Ryan Babbush , Dominic Berry

In this paper a nonlinear coupled Schrodinger system in the presence of mixed cubic and superlinear power laws is considered. A non standard numerical method is developed to approximate the solutions in higher dimensional case. The idea…

Numerical Analysis · Mathematics 2018-05-16 Abdurahman F. Aljohani , Anouar Ben Mabrouk

Several algorithms in computer algebra involve the computation of a power series solution of a given ordinary differential equation. Over finite fields, the problem is often lifted in an approximate $p$-adic setting to be well-posed. This…

Symbolic Computation · Computer Science 2023-06-12 Pierre Lairez , Tristan Vaccon

In this paper we consider finite-dimensional constrained Hamiltonian systems of polynomial type. In order to compute the complete set of constraints and separate them into the first and second classes we apply the modern algorithmic methods…

Numerical Analysis · Mathematics 2025-10-20 Vladimir P. Gerdt , Soso A. Gogilidze

In this article, a globally convergent sequential quadratic programming (SQP) method is developed for multi-objective optimization problems with inequality type constraints. A feasible descent direction is obtained using a linear…

Optimization and Control · Mathematics 2020-05-20 Md Abu Talhamainuddin Ansary , Geetanjali Panda

Inspired by Abbatiello, Feireisl and Novotn\'y, we prove the global existence of dissipative turbulent solution for the compressible Navier-Stokes equations with anisotropic viscous stress tensor on unbounded domain. Our work complements…

Analysis of PDEs · Mathematics 2025-10-24 Ondřej Kreml , Šárka Nečasová , Tong Tang

The technique of semidefinite programming (SDP) relaxation can be used to obtain a nontrivial bound on the optimal value of a nonconvex quadratically constrained quadratic program (QCQP). We explore concave quadratic inequalities that hold…

Optimization and Control · Mathematics 2016-09-30 Jaehyun Park , Stephen Boyd

Let $u$ be a non-negative super-solution to a $1$-dimensional singular parabolic equation of $p$-Laplacian type ($1<p<2$). If $u$ is bounded below on a time-segment $\{y\}\times(0,T]$ by a positive number $M$, then it has a power-like decay…

Analysis of PDEs · Mathematics 2016-08-08 Fatma Gamze Düzgün , Ugo Gianazza , Vincenzo Vespri

Perturbed Hodge-Dirac operators and their holomorphic functional calculi, as investigated in the papers by Axelsson, Keith and the second author, provided insight into the solution of the Kato square-root problem for elliptic operators in…

Functional Analysis · Mathematics 2015-03-04 Dorothee Frey , Alan McIntosh , Pierre Portal

In this paper, the compact linearization approach originally proposed for binary quadratic programs with assignment constraints is generalized to such programs with arbitrary linear equations and inequalities that have positive coefficients…

Optimization and Control · Mathematics 2018-08-28 Sven Mallach

Many computer vision problems can be formulated as binary quadratic programs (BQPs). Two classic relaxation methods are widely used for solving BQPs, namely, spectral methods and semidefinite programming (SDP), each with their own…

Computer Vision and Pattern Recognition · Computer Science 2016-11-18 Peng Wang , Chunhua Shen , Anton van den Hengel