Results 41 to 50 of about 93,156 (306)

A characterization of light open maps of Euclidean spaces into Euclidean spaces [PDF]

open access: yesProceedings of the American Mathematical Society, 1958
We will use the term open map to mean a map f of X into Y such that f(U) is open in Y for every open set U in X. A map f of Rn (Euclidean n-space) into Rm is pseudo-monotone if and only if Rn_ -f(X) has no bounded component for every closed set X in Rn such that Rm -X has no bounded component.
openaire   +2 more sources

On the decidability of connectedness constraints in 2D and 3D Euclidean spaces

open access: yes, 2011
We investigate (quantifier-free) spatial constraint languages with equality, contact and connectedness predicates as well as Boolean operations on regions, interpreted over low-dimensional Euclidean spaces. We show that the complexity of reasoning varies
Yavor Nenov   +11 more
core   +1 more source

Orthogonal embeddings of graphs in Euclidean space

open access: yesElectronic Journal of Graph Theory and Applications, 2019
Let G = (V, E) be a simple connected graph. An injective function f : V → Rn is called an n-dimensional (or n-D) orthogonal labeling of G if uv, uw ∈ E implies that (f(v) − f(u)) ⋅ (f(w) − f(u)) = 0, where  ⋅  is the usual dot product in Euclidean space.
Wai Chee Shiu, Richard M. Low
doaj   +1 more source

Thinking Outside the Euclidean Box: Riemannian Geometry and Inter-Temporal Decision-Making. [PDF]

open access: yesPLoS ONE, 2016
Inter-temporal decisions involves assigning values to various payoffs occurring at different temporal distances. Past research has used different approaches to study these decisions made by humans and animals.
Himanshu Mishra, Arul Mishra
doaj   +1 more source

Spheres in an Euclidean space

open access: yesInternational Journal of Contemporary Mathematical Sciences, 2007
Let \(M^n\) be a compact, orientable hypersurface in an Euclidean spaces. A sufficient condition involving the scalar curvature, the mean curvature and the infimum of the sectional curvature of \(M^n\) is found enforcing that \(M^n\) is a sphere.
openaire   +2 more sources

A Q‐Learning Algorithm to Solve the Two‐Player Zero‐Sum Game Problem for Nonlinear Systems

open access: yesInternational Journal of Adaptive Control and Signal Processing, Volume 39, Issue 3, Page 566-581, March 2025.
A Q‐learning algorithm to solve the two‐player zero‐sum game problem for nonlinear systems. ABSTRACT This paper deals with the two‐player zero‐sum game problem, which is a bounded L2$$ {L}_2 $$‐gain robust control problem. Finding an analytical solution to the complex Hamilton‐Jacobi‐Issacs (HJI) equation is a challenging task.
Afreen Islam   +2 more
wiley   +1 more source

What Do Large Language Models Know About Materials?

open access: yesAdvanced Engineering Materials, EarlyView.
If large language models (LLMs) are to be used inside the material discovery and engineering process, they must be benchmarked for the accurateness of intrinsic material knowledge. The current work introduces 1) a reasoning process through the processing–structure–property–performance chain and 2) a tool for benchmarking knowledge of LLMs concerning ...
Adrian Ehrenhofer   +2 more
wiley   +1 more source

Spinor Equations of Successor Curves

open access: yesUniversal Journal of Mathematics and Applications, 2022
The aim of this study is to give spinor representation of successive curves in three-dimensional Euclidean space. In three dimensional Euclidean Space, the spinor representations of a curve with unit speed and a successor curve with the same arc length ...
Hilal Köse Öztaş, Tülay Erişir
doaj   +1 more source

On Complete Locally Euclidean Spaces [PDF]

open access: yesProceedings of the American Mathematical Society, 1968
In [4] this result was proved by using Theorem 3 of [I]. We now give a new proof, independent of the results of [I]. The present proof has the advantage of being constructive, i.e. we actually show how to construct a certain subgroup of 7r which is required in the proof of Theorem A.
openaire   +2 more sources

A semismooth newton method for the nearest Euclidean distance matrix problem

open access: yes, 2013
The Nearest Euclidean distance matrix problem (NEDM) is a fundamentalcomputational problem in applications such asmultidimensional scaling and molecularconformation from nuclear magnetic resonance data in computational chemistry.Especially in the latter ...
Qi, Houduo
core   +1 more source

Home - About - Disclaimer - Privacy