Results 1 to 10 of about 264,685 (296)
Brouwer’s satellite solution redux [PDF]
Celestial Mechanics and Dynamical Astronomy, 2021 AbstractBrouwer’s solution to the artificial satellite problem is revisited. We show that the complete Hamiltonian reduction is rather achieved in the plain Poincaré’s style, through a single canonical transformation, than using a sequence of partial reductions based on von Zeipel’s alternative for dealing with perturbed degenerate Hamiltonian systems.
Martin Lara
exaly +8 more sources
The Creating Subject, the Brouwer–Kripke Schema, and infinite proofs [PDF]
Indagationes Mathematicae, 2018 Kripke's Schema (better the Brouwer-Kripke Schema) and the Kreisel-Troelstra Theory of the Creating Subject were introduced around the same time for the same purpose, that of analysing Brouwer's 'Creating Subject arguments'; other applications have been ...
Mark van Atten
exaly +2 more sources
Brouwer and cardinalities [PDF]
Indagationes Mathematicae, 2018 Version 3 of 2017-07-06, changes made after further ...
exaly +5 more sources
Brouwer degree for Kazdan-Warner equations on a connected finite graph [PDF]
Advances in Mathematics, 2021 We study Kazdan-Warner equations on a connected finite graph via the method of the degree theory. Firstly, we prove that all solutions to the Kazdan-Warner equation with nonzero prescribed function are uniformly bounded and the Brouwer degree is well ...
Linlin Sun, Liuquan Wang
semanticscholar +1 more source
Browder’s Theorem through Brouwer’s Fixed Point Theorem [PDF]
The American mathematical monthly, 2021 A parametric version of Brouwer’s fixed point theorem, called Browder’s theorem, states that for every continuous mapping , where X is a nonempty, compact, and convex set in a Euclidean space, the set of fixed points of f, namely, the set , has a ...
Eilon Solan, O. Solan
semanticscholar +1 more source
A Proof of Brouwer's Toughness Conjecture [PDF]
SIAM Journal on Discrete Mathematics, 2020 The toughness $t(G)$ of a connected graph $G$ is defined as $t(G)=\min\{\frac{|S|}{c(G-S)}\}$, in which the minimum is taken over all proper subset $S\subset V(G)$ such that $c(G-S)>1$, where $c(G-S)$ denotes the number of components of $G-S$.
Xiaofeng Gu
semanticscholar +1 more source
La construcción motívica en el Concierto Elegíaco de Leo Brouwer
Musica Theorica, 2023 El objetivo central de este artículo es examinar el uso que el compositor cubano Leo Brouwer hace de la construcción motívica en su Concierto Elegíaco. En primer lugar, se analizan los conceptos de motivo y célula a partir de las definiciones propuestas
Rodrigo Lara Alonso
doaj +1 more source
Constraints on Brouwer's Laplacian spectrum conjecture [PDF]
Linear Algebra and its Applications, 2020 Brouwer's Conjecture states that, for any graph $G$, the sum of the $k$ largest (combinatorial) Laplacian eigenvalues of $G$ is at most $|E(G)| + \binom{k+1}{2}$, $1 \leq k \leq n$.
Joshua N. Cooper
semanticscholar +1 more source