Related papers: Prolongations of Geometric Overdetermined Systems
Over an algebraically closed field, we describe the affine varieties of solutions to the linear equations $a(xb)=c$ and $a(bx)=c$ over the split-octonions. We also determine the dimensions of the solution sets of arbitrary linear monomial…
Bilinear systems of equations are defined, motivated and analyzed for solvability. Elementary structure is mentioned and it is shown that all solutions may be obtained as rank one completions of a linear matrix polynomial derived from…
We determine a considerable class of nonlinear partial differential equation systems which have global regular solutions. Uniqueness is not a direct general consequence of this method. The scheme can be applied to the incompressible Navier…
In this paper we study a semilinear elliptic problem on a bounded domain in $\R^2$ with large exponent in the nonlinear term. We consider positive solutions obtained by minimizing suitable functionals. We prove some asymtotic estimates…
Using exhaustion method and finite differences a new method to solve system of partial differential equations and is presented. This method allows design algorithm to solve linear and nonlinear systems in irregular domains. Applying this…
Solutions which are quasimodular forms to a second order differential equation attached to a triangular group are explicitly described in terms of certain orthogonal polynomials.
The linearization of complex ordinary differential equations is studied by extending Lie's criteria for linearizability to complex functions of complex variables. It is shown that the linearization of complex ordinary differential equations…
We consider a mixed dimensional elliptic partial differential equation posed in a bulk domain with a large number of embedded interfaces. In particular, we study well-posedness of the problem and regularity of the solution. We also propose…
We consider a class of optimization problems that involve determining the maximum value that a function in a particular class can attain subject to a collection of difference constraints. We show that a particular linear programming…
We construct positive weak solutions of a class of semilinear elliptic equation which vanish in suitable trace sense on the boundary of a given smooth bounded N-dimensional domain, but which are singular at prescribed isolated points of the…
We consider a system of differential equations and obtain its solutions with exponential asymptotics and analyticity with respect to the spectral parameter. Solutions of such type have importance in studying spectral properties of…
We provide bounds on the size of polynomial differential equations obtained by executing closure properties for D-algebraic functions. While it is easy to obtain bounds on the order of these equations, it requires some more work to derive…
We establish the existence of weak solutions of coupled systems of elliptic partial differential equations with quasimonotone nonlinearities in the domain interior and on the boundary. When the nonlinearities satisfy some monotonicity…
Let $E_1,\ldots,E_k$ be a collection of linear series on an algebraic variety $X$ over $\mathbb{C}$. That is, $E_i\subset H^0(X, \mathcal{L}_i)$ is a finite dimensional subspace of the space of regular sections of line bundles $…
The question whether a Riemannian manifold is geodesically connected can be studied from geometrical as well as variational methods, and accurate results can be obtained by using the associated distance and related properties of the…
We consider quasilinear elliptic systems in divergence form. In general, we cannot expect that weak solutions are locally bounded because of De Giorgi's counterexample. Here we assume a condition on the support of off-diagonal coefficients…
We address the question of whether geometric conditions on the given data can be preserved by a solution in (1) the Whitney extension problem, and (2) the Brenner-Fefferman-Hochster-Koll\'ar problem, both for $\mathcal C^m$ functions. Our…
We investigate the descriptional complexity of operations on semilinear sets. Roughly speaking, a semilinear set is the finite union of linear sets, which are built by constant and period vectors. The interesting parameters of a semilinear…
The numerical range of a matrix is studied geometrically via the cone of positive semidefinite matrices (or semidefinite cone for short). In particular it is shown that the feasible set of a two-dimensional linear matrix inequality (LMI),…
The numerical range of a matrix is studied geometrically via the cone of positive semidefinite matrices (or semidefinite cone for short). In particular it is shown that the feasible set of a two-dimensional linear matrix inequality (LMI),…