Related papers: Some boundedness results for systems of two ration…

We provide improved upper and lower bounds for the Min-Sum-Radii (MSR) and Min-Sum-Diameters (MSD) clustering problems with a bounded number of clusters $k$. In particular, we propose an exact MSD algorithm with running-time $n^{O(k)}$. We…

We study mirror symmetry (A-side vs B-side) in the framework of quantum differential systems. We focuse on the logarithmic and non-resonant case, which describes the geometric situation. We show that quantum differential systems provide a…

In this paper the theory of semi-bounded rationality is proposed as an extension of the theory of bounded rationality. In particular, it is proposed that a decision making process involves two components and these are the correlation…

We study regularity issues for systems of elliptic equations of the type \[ -\Delta u_i=f_{i,\beta}(x)-\beta \sum_{j\neq i} a_{ij} u_i |u_i|^{p-1}|u_j|^{p+1} \] set in domains $\Omega \subset \mathbb{R}^N$, for $N \geq 1$. The paper is…

A new proof for adjoint systems of linear equations is presented. The argument is built on the principles of Algorithmic Differentiation. Application to scalar multiplication sets the base line. Generalization yields adjoint inner vector,…

We study first-order concatenation theory with bounded quantifiers. We give axiomatizations with interesting properties, and we prove some normal-form results. Finally, we prove a number of decidability and undecidability results.

We consider small nonlinear perturbations of linear systems on a time scale with the phase space being finite or infinite-dimensional. For $\Delta$-differential operators, corresponding to linear dynamic systems we consider their…

Let $\sigma_{i}(x_{1},\ldots, x_{n})=\sum_{1\leq k_{1}<k_{2}<\ldots <k_{i}\leq n}x_{k_{1}}\ldots x_{k_{i}}$ be the $i$-th elementary symmetric polynomial. In this note we generalize and extend the results obtained in a recent work of Zhang…

Using a recently introduced framework, we derive criteria for quantum k-separability, which are very easily computed. In the case k = 2, our criteria are equally strong to the best methods known so far, while in all other cases there are…

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…

Assessing the boundedness and stability of vector nonlinear systems with variable delays and coefficients remains a challenging problem with broad applications in science and engineering. Existing methods tend to produce overly conservative…

Optimizing strategic decisions (a.k.a. computing equilibrium) is key to the success of many non-cooperative multi-agent applications. However, in many real-world situations, we may face the exact opposite of this game-theoretic problem --…

Recently ,mathematicians have been interested in studying the theory of discrete dynamical system, specifically difference equation, such that considerable works about discussing the behavior properties of its solutions (boundedness and…

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…

Abramov's algorithm enables us to decide whether a univariate rational function can be written as a difference of another rational function, which has been a fundamental algorithm for rational summation. In 2014, Chen and Singer generalized…

We extend the definition of $n$-dimensional difference equations to complex order $\alpha\in \mathbb{C} $. We investigate the stability of linear systems defined by an $n$-dimensional matrix $A$ and derive conditions for the stability of…

The Riccati equation method is used for study the behavior of solutions of the systems of two linear first order ordinary differential equations. All types of oscillation and regularity of these system are revealed. A generalization of…

Given a truncated perturbation expansion of a physical quantity, one can, under certain circumstances, obtain lower or upper bounds (or both) to the sum of the full perturbation series by using the Borel transform and a variational…

We consider the classical $k$-means clustering problem in the setting bi-criteria approximation, in which an algoithm is allowed to output $\beta k > k$ clusters, and must produce a clustering with cost at most $\alpha$ times the to the…

We prove a number of \textit{a priori} estimates for weak solutions of elliptic equations or systems with vertically independent coefficients in the upper-half space. These estimates are designed towards applications to boundary value…