Results 11 to 20 of about 708,969 (305)
Topology and its Applications, 2020 In [3] Borzellino and Brunsden started to develop an elementary differential topology theory for orbifolds. In this paper we carry on their project by defining a mapping degree for proper maps between orbifolds, which counts preimages of regular values with appropriate weights.
Pasquotto, Federica, Rot, Thomas O.
openaire +5 more sources
Merging of degree and index theory
Fixed Point Theory and Applications, 2006 The topological approaches to find solutions of a coincidence equation can roughly be divided into degree and index theories. We describe how these methods can be combined. We are led to a concept of an extended degree theory for function triples which
Väth Martin
doaj +4 more sources
Finding planted partitions in random graphs with general degree distributions [PDF]
, 2009 We consider the problem of recovering a planted partition such as a coloring, a small bisection, or a large cut in an (apart from that) random graph. In the last 30 years many algorithms for this problem have been developed that work provably well on ...
Coja-Oghlan, Amin, Lanka, André
core +1 more source
Mathematics, 2023 This paper deals with two types of systems of second-order differential equations with parameters: coupled systems with the boundary conditions of the Sturm–Liouville type and classical systems with Dirichlet boundary conditions.
Feliz Minhós, Gracino Rodrigues
doaj +1 more source
Third-order differential equations with three-point boundary conditions
Open Mathematics, 2021 In this paper, a third-order ordinary differential equation coupled to three-point boundary conditions is considered. The related Green’s function changes its sign on the square of definition. Despite this, we are able to deduce the existence of positive
Cabada Alberto, Dimitrov Nikolay D.
doaj +1 more source
Degrees of sensible lambda theories [PDF]
Journal of Symbolic Logic, 1978 SummaryA λ-theory T is a consistent set of equations between λ-terms closed under derivability. The degree of T is the degree of the set of Gödel numbers of its elements. is the λ-theory axiomatized by the set {M = N∣ M, N unsolvable}. A λ-theory is sensible iff T ⊃ ; for a motivation see [6] and [4].In §1 it is proved that the theory is Σ20-complete.
Bergstra, J.A. +3 more
openaire +3 more sources
Testing hereditary properties of nonexpanding bounded-degree graphs [PDF]
, 2007 We study graph properties that are testable for bounded-degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined graph property and graphs that are far from every graph having that property. It
Christian Sohler +5 more
core +1 more source
Janus.net, 2022 Over the last fourteen years, the Gaza Strip has been under a land, sea and air siege imposed by Israel and Egypt. Throughout these years, Palestinians from the Gaza Strip have endured three Israeli military operations inside a besieged territory and ...
João Pedro Borralho
doaj +1 more source
The theory of the α degrees is undecidable [PDF]
Israel Journal of Mathematics, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chong, C.T., Slaman, T.A.
openaire +2 more sources
Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements [PDF]
, 2014 We consider degree bounded network design problems with element and vertex connectivity requirements. In the degree bounded Survivable Network Design (SNDP) problem, the input is an undirected graph G = (V, E) with weights w(e) on the edges and degree ...
Ali Vakilian +3 more
core +1 more source