English
Related papers

Related papers: On uncommon systems of equations

200 papers

An old question in Ramsey theory asks whether any finite coloring of the natural numbers admits a monochromatic pair $\{x+y,xy\}$. We answer this question affirmatively in a strong sense by exhibiting a large new class of non-linear…

Combinatorics · Mathematics 2016-05-06 Joel Moreira

We consider the existence of \emph{normalized} solutions in $H^1(\R^N) \times H^1(\R^N)$ for systems of nonlinear Schr\"odinger equations which appear in models for binary mixtures of ultracold quantum gases. Making a solitary wave ansatz…

Analysis of PDEs · Mathematics 2015-07-17 Thomas Bartsch , Louis Jeanjean

Nonclassical symmetries and reductions of polynomial equations and systems of polynomial equations are considered. It is shown that specific polynomial equations having "hidden" symmetries can be reduced to classical symmetric systems of…

Numerical Analysis · Mathematics 2026-01-22 Inna K. Shingareva , Andrei D. Polyanin

A nonlinear fourth-order parabolic equation in one space dimension with periodic boundary conditions is studied. This equation arises in the context of fluctuations of a stationary nonequilibrium interface and in the modeling of quantum…

Analysis of PDEs · Mathematics 2007-05-23 J. Dolbeault , I. Gentil , A. Jungel

Lie's linearizability criteria for scalar second-order ordinary differential equations had been extended to systems of second-order ordinary differential equations by using geometric methods. These methods not only yield the linearizing…

Classical Analysis and ODEs · Mathematics 2011-07-25 S. Ali , F. M. Mahomed , Asghar Qadir

This work introduces a methodology to solve ordinary differential equations using the Schur decomposition of the linear representation of the differential equation. This is done by first transforming the system into an upper triangular…

Dynamical Systems · Mathematics 2021-11-16 David Arnas

For $k \ge 4$, a loose $k$-cycle $C_k$ is a hypergraph with distinct edges $e_1, e_2, \ldots, e_k$ such that consecutive edges (modulo $k$) intersect in exactly one vertex and all other pairs of edges are disjoint. Our main result is that…

Combinatorics · Mathematics 2025-01-29 Dhruv Mubayi , Lujia Wang

The security of multivariate cryptosystems and digital signature schemes relies on the hardness of solving a system of polynomial equations over a finite field. Polynomial system solving is also currently a bottleneck of index-calculus…

Cryptography and Security · Computer Science 2020-11-03 M. Bigdeli , E. De Negri , M. M. Dizdarevic , E. Gorla , R. Minko , S. Tsakou

We show that for every second order Fuchsian linear differential equation $E$ with $n$ singularities of which $n-3$ are apparent there exists a hypergeometric equation $H$ and a linear differential operator with polynomial coefficients…

Classical Analysis and ODEs · Mathematics 2018-06-18 Alexandre Eremenko , Vitaly Tarasov

We consider the uniqueness of solution (i.e., nonsingularity) of systems of $r$ generalized Sylvester and $\star$-Sylvester equations with $n\times n$ coefficients. After several reductions, we show that it is sufficient to analyze periodic…

Numerical Analysis · Mathematics 2019-06-18 Fernando De Terán , Bruno Iannazzo , Federico Poloni , Leonardo Robol

We investigate the space complexity of solving linear systems of equations. While all known deterministic or randomized algorithms solving a square system of $n$ linear equations in $n$ variables require $\Omega(\log^2 n)$ space, Ta-Shma…

Computational Complexity · Computer Science 2016-08-05 François Le Gall

We classify general square systems of polynomial equations solvable in radicals. Expectedly, they are almost in a 1-to-1 correspondence with tuples of lattice polytopes of mixed volume not exceeding 4. The proof is based on the computation…

Algebraic Geometry · Mathematics 2018-02-02 Alexander Esterov , Gleb Gusev

We introduce a notion of complexity for systems of linear forms, called sequential Cauchy-Schwarz complexity, which is parametrized by two positive integers $k,\ell$ and refines the notion of Cauchy-Schwarz complexity introduced by Green…

Combinatorics · Mathematics 2022-07-05 Pablo Candela , Diego González-Sánchez , Balázs Szegedy

In 1970 Hajnal and Szemer\'edi proved a conjecture of Erd\"os that for a graph with maximum degree $\Delta$, there exists an equitable $\Delta+1$ coloring; that is a coloring where color class sizes differ by at most $1$. In 2007 Kierstand…

Combinatorics · Mathematics 2026-03-10 Aiya Kuchukova , Will Perkins , Xavier Povill

Massive bigravity models are interesting alternatives to standard cosmology. In most cases, however, these models have been studied for a simplified scenario in which both metrics take homogeneous and isotropic forms…

General Relativity and Quantum Cosmology · Physics 2015-11-18 Henrik Nersisyan , Yashar Akrami , Luca Amendola

Systems of equations with sets of integers as unknowns are considered. It is shown that the class of sets representable by unique solutions of equations using the operations of union and addition $S+T=\makeset{m+n}{m \in S, \: n \in T}$ and…

Formal Languages and Automata Theory · Computer Science 2013-10-28 Artur Jeż , Alexander Okhotin

Properties of solutions of generic hyperbolic systems with multiple characteristics with diagonalizable principal part are investigated. Solutions are represented as a Picard series with terms in the form of iterated Fourier integral…

Analysis of PDEs · Mathematics 2008-02-05 Ilia Kamotski , Michael Ruzhansky

A vertex coloring of a simplicial complex $\Delta$ is called a linear coloring if it satisfies the property that for every pair of facets $(F_1, F_2)$ of $\Delta$, there exists no pair of vertices $(v_1, v_2)$ with the same color such that…

Combinatorics · Mathematics 2007-05-23 Yusuf Civan , Ergun Yalcin

We study generic constrained differential equations (CDEs) with three parameters, thereby extending Takens's classification of singularities of such equations. In this approach, the singularities analyzed are the Swallowtail, the…

Dynamical Systems · Mathematics 2018-05-11 H. Jardón-Kojakhmetov , Henk Broer

We generalize the notion of orthogonal latin squares to colorings of simple graphs. Two $n$-colorings of a graph are said to be \emph{orthogonal} if whenever two vertices share a color in one coloring they have distinct colors in the other…

Combinatorics · Mathematics 2012-12-03 Serge C. Ballif