Results 251 to 260 of about 341,235 (326)
Aspect perception and rule‐following in Wittgenstein's Philosophical Investigations
Abstract This paper aims to highlight a distinctive, projective, mode of aspect perception within Wittgenstein's philosophy that has gone underappreciated in the scholarly literature. Although it bears a family resemblance to other instances of the phenomenon Wittgenstein describes as ‘noticing an aspect’ in PI Part II §113, it is distinctive in that ...
James Connelly
wiley +1 more source
Exploring Ground and Excited States Via Single Reference Coupled-Cluster Theory and Algebraic Geometry. [PDF]
Sverrisdóttir S, Faulstich FM.
europepmc +1 more source
The ultrafilter theorem in real algebraic geometry
openaire +2 more sources
On a rigidity property for quadratic gauss sums
Abstract Let N$N$ be a large prime and let c>1/4$c > 1/4$. We prove that if f$f$ is a ±1$\pm 1$‐valued multiplicative function, such that the exponential sums Sf(a):=∑1⩽n
Alexander P. Mangerel
wiley +1 more source
"Amide - amine + alcohol = carboxylic acid." chemical reactions as linear algebraic analogies in graph neural networks. [PDF]
El-Samman AM, De Baerdemacker S.
europepmc +1 more source
BLOWING UP IN THE CATEGORY OF FORMAL COMPLEX SPACES(Real Singularities and Real Algebraic Geometry)
Shuzo Izumi
openalex +1 more source
On certain extremal Banach–Mazur distances and Ader's characterization of distance ellipsoids
Abstract A classical consequence of the John Ellipsoid Theorem is the upper bound n$\sqrt {n}$ on the Banach–Mazur distance between the Euclidean ball and any symmetric convex body in Rn$\mathbb {R}^n$. Equality is attained for the parallelotope and the cross‐polytope. While it is known that they are unique with this property for n=2$n=2$ but not for n⩾
Florian Grundbacher, Tomasz Kobos
wiley +1 more source
Characterisation of quadratic spaces over the Hilbert field by means of the orthogonality relation. [PDF]
Korbelář M, Paseka J, Vetterlein T.
europepmc +1 more source
Abstract In the “Covering” pursuit game on a graph, a robber and a set of cops play alternately, with the cops each moving to an adjacent vertex (or not moving) and the robber moving to a vertex at distance at most 2 from his current vertex. The aim of the cops is to ensure that, after every one of their turns, there is a cop at the same vertex as the ...
Benjamin Gillott
wiley +1 more source

