Results 101 to 110 of about 3,063 (228)
A categorical interpretation of continuous orbit equivalence for partial dynamical systems
Abstract We define the orbit morphism of partial dynamical systems and prove that an orbit morphism being an isomorphism in the category of partial dynamical systems and orbit morphisms is equivalent to the existence of a continuous orbit equivalence between the given partial dynamical systems that preserves the essential stabilisers. We show that this
Gilles G. de Castro, Eun Ji Kang
wiley +1 more source
An allocation rule for connection scheduling problems
Abstract This paper studies so‐called connection scheduling problems, a type of interactive operations research problem. A connection scheduling problem combines aspects from the minimum cost spanning tree and sequencing problems. Given a graph, we aim to first establish a connection order on the players such that the total cost of connecting them to a
Laura Davila‐Pena +3 more
wiley +1 more source
Bijections from Dyck and Motzkin meanders with catastrophes to pattern avoiding Dyck paths [PDF]
Jean-Luc Baril, Sergey Kirgizov
doaj +1 more source
Bijections for hook pair identities [PDF]
Short, bijective proofs of identities for multisets of 'hook pairs' (arm-leg pairs) of the cells of certain diagrams are given. These hook pair identities were originally found by Regev.
openaire +4 more sources
Quasi‐invariance of Gaussian measures for the 3d$3d$ energy critical nonlinear Schrödinger equation
Abstract We consider the 3d$3d$ energy critical nonlinear Schrödinger equation with data distributed according to the Gaussian measure with covariance operator (1−Δ)−s$(1-\Delta)^{-s}$, where Δ$\Delta$ is the Laplace operator and s$s$ is sufficiently large. We prove that the flow sends full measure sets to full measure sets. We also discuss some simple
Chenmin Sun, Nikolay Tzvetkov
wiley +1 more source
On the analytic bijections of the rationals in [0,1] [PDF]
We carry out an arithmetical study of analytic functions f: [0,1] \to [0,1] that by restriction induce a bijection \mathbb{Q} \cap [0,1] \to \mathbb{Q} \cap [0,1] . The existence of such functions shows that, unless
openaire +4 more sources
Face Sizes and the Connectivity of the Dual
ABSTRACT For each c ≥ 1, we prove tight lower bounds on face sizes that must be present to allow 1‐ or 2‐cuts in simple duals of c‐connected maps. Using these bounds, we determine the smallest genus on which a c‐connected map can have a simple dual with a 2‐cut and give lower and some upper bounds for the smallest genus on which a c‐connected map can ...
Gunnar Brinkmann +2 more
wiley +1 more source
A Bijective Proof for a Theorem of Ehrhart [PDF]
We give a new proof for a theorem of Ehrhart regarding the quasi-polynomiality of the function that counts the number of integer points in the integral dilates of a rational polytope. The proof involves a geometric bijection, inclusion-exclusion, and recurrence relations, and we also prove Ehrhart reciprocity using these methods.
openaire +3 more sources
Counterexamples Regarding Linked and Lean Tree‐Decompositions of Infinite Graphs
ABSTRACT Kříž and Thomas showed that every (finite or infinite) graph of tree‐width k ∈ N admits a lean tree‐decomposition of width k. We discuss a number of counterexamples demonstrating the limits of possible generalisations of their result to arbitrary infinite tree‐width.
Sandra Albrechtsen +3 more
wiley +1 more source
Some new families of compositions based on big part restrictions [PDF]
Augustine O. Munagi, Mark Shattuck
doaj +1 more source

