Results 231 to 240 of about 1,336,081 (334)
Splitting unramified Brauer classes by abelian torsors and the period-index problem. [PDF]
Huybrechts D, Mattei D.
europepmc +1 more source
Analysis of image formation in optical palpation
Optical palpation is an emerging elastography technique that generates images of mechanical stress at the tissue surface, with applications in intraoperative cancer detection. Image formation is simulated using finite element analysis and validated with experiments on silicone phantoms, providing an analysis of trends in detectability, feature ...
R. Jones, Q. Fang, B. F. Kennedy
wiley +1 more source
Graph Geometric Algebra networks for graph representation learning. [PDF]
Zhong J, Cao W.
europepmc +1 more source
A Sharper Ramsey Theorem for Constrained Drawings
ABSTRACT Given a graph G $G$ and a collection C ${\mathscr{C}}$ of subsets of Rd ${{\mathbb{R}}}^{d}$ indexed by the subsets of vertices of G $G$, a constrained drawing of G $G$ is a drawing where each edge is drawn inside some set from C ${\mathscr{C}}$, in such a way that nonadjacent edges are drawn in sets with disjoint indices.
Pavel Paták
wiley +1 more source
The Group-Algebraic Formalism of Quantum Probability and Its Applications in Quantum Statistical Mechanics. [PDF]
Gu Y, Wang J.
europepmc +1 more source
Edge‐Connectivity Between Edge‐Ends of Infinite Graphs
ABSTRACT In infinite graph theory, the notion of ends, first introduced by Freudenthal and Jung for locally finite graphs, plays an important role when generalizing statements from finite graphs to infinite ones. Nash‐Williams' Tree‐Packing Theorem and MacLane's Planarity Criteria are examples of results that allow a topological approach, in which ends
Leandro Aurichi, Lucas Real
wiley +1 more source
Boson-Fermion Algebraic Mapping in Second Quantization. [PDF]
Lingua F+3 more
europepmc +1 more source
The Generic Circular Triangle‐Free Graph
ABSTRACT In this article, we introduce the generic circular triangle‐free graph C 3 ${{\mathbb{C}}}_{3}$ and propose a finite axiomatization of its first‐order theory. In particular, our main results show that a countable graph G $G$ embeds into C 3 ${{\mathbb{C}}}_{3}$ if and only if it is a { K 3 , K 1 + 2 K 2 , K 1 + C 5 , C 6 } $\{{K}_{3},{K}_{1}+2{
Manuel Bodirsky, Santiago Guzmán‐Pro
wiley +1 more source