Results 61 to 70 of about 208,586 (219)

Dynamic Optimal Transport with Optimal Star‐Shaped Graphs

open access: yesPAMM, Volume 26, Issue 1, March 2026.
ABSTRACT We study an optimal transport problem in a compact convex set Ω⊂Rd$\Omega \subset \mathbb {R}^d$ where bulk transport is coupled to dynamic optimal transport on a metric graph G=(V,E,l)$ \mathsf {G}= (\mathsf {V},\mathsf {E},l)$ which is embedded in Ω$\Omega$. We prove the existence of solutions for fixed graphs.
Marcello Carioni   +2 more
wiley   +1 more source

An expected polynomial time algorithm for coloring 2-colorable 3-graphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2011
Graphs and ...
Yury Person, Mathias Schacht
doaj   +1 more source

Generalised Poincar\'e series and embedded resolution of curves

open access: yes, 2010
The purpose of this paper is to extend the notions of generalised Poincar\'e series and divisorial generalised Poincar\'e series (of motivic nature) introduced by Campillo, Delgado and Gusein-Zade for complex curve singularities to curves defined over ...
Moyano-Fernández, Julio José
core   +1 more source

Solvability of invariant systems of differential equations on H2$\mathbb {H}^2$ and beyond

open access: yesMathematische Nachrichten, Volume 299, Issue 2, Page 456-479, February 2026.
Abstract We show how the Fourier transform for distributional sections of vector bundles over symmetric spaces of non‐compact type G/K$G/K$ can be used for questions of solvability of systems of invariant differential equations in analogy to Hörmander's proof of the Ehrenpreis–Malgrange theorem.
Martin Olbrich, Guendalina Palmirotta
wiley   +1 more source

A Riemannian View on Shape Optimization

open access: yes, 2014
Shape optimization based on the shape calculus is numerically mostly performed by means of steepest descent methods. This paper provides a novel framework to analyze shape-Newton optimization methods by exploiting a Riemannian perspective.
Schulz, Volker
core   +1 more source

On Improving Roth's Theorem in the Primes [PDF]

open access: yes, 2014
Let $A\subset\left\{ 1,\dots,N\right\} $ be a set of prime numbers containing no non-trivial arithmetic progressions. Suppose that $A$ has relative density $\alpha=|A|/\pi(N)$, where $\pi(N)$ denotes the number of primes in the set $\left\{ 1,\dots,N ...
Naslund, Eric
core   +1 more source

Asymptotic Properties for a General Class of Szász–Mirakjan–Durrmeyer Operators

open access: yesMathematical Methods in the Applied Sciences, Volume 49, Issue 2, Page 734-743, 30 January 2026.
ABSTRACT In this paper, we introduce a general family of Szász–Mirakjan–Durrmeyer type operators depending on an integer parameter j∈ℤ$$ j\in \mathbb{Z} $$. They can be viewed as a generalization of the Szász–Mirakjan–Durrmeyer operators, Phillips operators, and corresponding Kantorovich modifications of higher order.
Ulrich Abel   +3 more
wiley   +1 more source

Selbstreguliertes und kooperatives Lernen mit digitalen Medien – Ergebnisse der SITE-Studie und der SelMa-Evaluation

open access: yesMedienPädagogik: Zeitschrift für Theorie und Praxis der Medienbildung, 2017
Der vorliegende Beitrag stellt Ergebnisse zum selbstregulierten und kooperativen Lernen aus zwei vom Institut für Schulentwicklungsforschung der Universität Dortmund durchgeführten Studien vor.
Renate Schulz-Zander, Annabell Preussler
doaj   +1 more source

The Degree Distribution of Thickened Trees [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2008
We develop a combinatorial structure to serve as model of random real world networks. Starting with plane oriented recursive trees we substitute the nodes by more complex graphs.
Michael Drmota   +2 more
doaj   +1 more source

Schülerwettbewerbe beim Tag der Mathematik [PDF]

open access: yes, 2012
Initiiert vom Zentrum für Mathematik finden seit 1992 jährlich unter dem Titel "Tag der Mathematik " Schülerwettbewerbe für interessierte Schülerinnen und Schüler der Jahrgangsstufen 11 und 12 statt.
Faas, Dominik
core  

Home - About - Disclaimer - Privacy