Results 151 to 160 of about 827 (202)

Entropy rigidity for cusped Hitchin representations

open access: yesJournal of Topology, Volume 19, Issue 1, March 2026.
Abstract We establish an entropy rigidity theorem for Hitchin representations of geometrically finite Fuchsian groups which generalizes a theorem of Potrie and Sambarino for Hitchin representations of closed surface groups. In the process, we introduce the class of (1,1,2)‐hypertransverse groups and show for such a group that the Hausdorff dimension of
Richard Canary   +2 more
wiley   +1 more source

General topology meets model theory, on p and t. [PDF]

open access: yesProc Natl Acad Sci U S A, 2013
Malliaris M, Shelah S.
europepmc   +1 more source

Numerical Approximation of a PDE‐Constrained Optimization Problem that Appears in Data‐Driven Computational Mechanics

open access: yesInternational Journal for Numerical Methods in Engineering, Volume 127, Issue 4, 28 February 2026.
ABSTRACT We investigate an optimization problem that arises when working within the paradigm of Data‐Driven Computational Mechanics. In the context of the diffusion‐reaction problem, such an optimization problem seeks the continuous primal fields (gradient and flux) that are closest to some predefined discrete fields taken from a material data set. The
Pedro B. Bazon   +3 more
wiley   +1 more source

Algebraic aspects of the computably enumerable degrees. [PDF]

open access: yesProc Natl Acad Sci U S A, 1995
Slaman TA, Soare RI.
europepmc   +1 more source

On Hilbert’s inequality in 𝑛 dimensions [PDF]

open access: yesBulletin of the American Mathematical Society, 1962
de Bruijn, N. G., Wilf, Herbert S.
openaire   +2 more sources

Landau's converse to H\" older's inequality

open access: yes
By H\" older's inequality, if $\mathbf{x} \in \ell^p$, then $\mathbf{x}\mathbf{y} \in \ell^1$ for all $\mathbf{y} \in \ell^q$. Landau proved the converse result: If $\mathbf{x}\mathbf{y} \in \ell^1$ for all $\mathbf{y} \in \ell^q$, then $\mathbf{x} \in ...
Nathanson, Melvyn B.
core  

Home - About - Disclaimer - Privacy