The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Linear combinations of partitions of unity with restricted supports”

Extension of point-finite partitions of unity

Haruto Ohta, Kaori Yamazaki (2006)

Fundamenta Mathematicae

Similarity:

A subspace A of a topological space X is said to be P γ -embedded ( P γ (point-finite)-embedded) in X if every (point-finite) partition of unity α on A with |α| ≤ γ extends to a (point-finite) partition of unity on X. The main results are: (Theorem A) A subspace A of X is P γ (point-finite)-embedded in X iff it is P γ -embedded and every countable intersection B of cozero-sets in X with B ∩ A = ∅ can be separated from A by a cozero-set in X. (Theorem B) The product A × [0,1] is P γ (point-finite)-embedded...

On a magnetic characterization of spectral minimal partitions

Bernard Helffer, Thomas Hoffmann-Ostenhof (2013)

Journal of the European Mathematical Society

Similarity:

Given a bounded open set Ω in n (or in a Riemannian manifold) and a partition of Ω by k open sets D j , we consider the quantity 𝚖𝚊𝚡 j λ ( D j ) where λ ( D j ) is the ground state energy of the Dirichlet realization of the Laplacian in D j . If we denote by k ( Ω ) the infimum over all the k -partitions of 𝚖𝚊𝚡 j λ ( D j ) , a minimal k -partition is then a partition which realizes the infimum. When k = 2 , we find the two nodal domains of a second eigenfunction, but the analysis of higher k ’s is non trivial and quite interesting. In this...

Partitioning planar graph of girth 5 into two forests with maximum degree 4

Min Chen, André Raspaud, Weifan Wang, Weiqiang Yu (2024)

Czechoslovak Mathematical Journal

Similarity:

Given a graph G = ( V , E ) , if we can partition the vertex set V into two nonempty subsets V 1 and V 2 which satisfy Δ ( G [ V 1 ] ) d 1 and Δ ( G [ V 2 ] ) d 2 , then we say G has a ( Δ d 1 , Δ d 2 ) -partition. And we say G admits an ( F d 1 , F d 2 ) -partition if G [ V 1 ] and G [ V 2 ] are both forests whose maximum degree is at most d 1 and d 2 , respectively. We show that every planar graph with girth at least 5 has an ( F 4 , F 4 ) -partition.

Three-space problems for the approximation property

A. Szankowski (2009)

Journal of the European Mathematical Society

Similarity:

It is shown that there is a subspace Z q of q for 1 < q < 2 which is isomorphic to q such that q / Z q does not have the approximation property. On the other hand, for 2 < p < there is a subspace Y p of p such that Y p does not have the approximation property (AP) but the quotient space p / Y p is isomorphic to p . The result is obtained by defining random “Enflo-Davie spaces” Y p which with full probability fail AP for all 2 < p and have AP for all 1 p 2 . For 1 < p 2 , Y p are isomorphic to p .

Ramsey partitions and proximity data structures

Manor Mendel, Assaf Naor (2007)

Journal of the European Mathematical Society

Similarity:

This paper addresses two problems lying at the intersection of geometric analysis and theoretical computer science: The non-linear isomorphic Dvoretzky theorem and the design of good approximate distance oracles for large distortion.We introduce the notion of Ramsey partitions of a finite metric space, and show that the existence of good Ramsey partitions implies a solution to the metric Ramsey problem for large distortion (also known as the non-linear version of the isomorphic Dvoretzky...

Matchings in complete bipartite graphs and the r -Lah numbers

Gábor Nyul, Gabriella Rácz (2021)

Czechoslovak Mathematical Journal

Similarity:

We give a graph theoretic interpretation of r -Lah numbers, namely, we show that the r -Lah number n k r counting the number of r -partitions of an ( n + r ) -element set into k + r ordered blocks is just equal to the number of matchings consisting of n - k edges in the complete bipartite graph with partite sets of cardinality n and n + 2 r - 1 ( 0 k n , r 1 ). We present five independent proofs including a direct, bijective one. Finally, we close our work with a similar result for r -Stirling numbers of the second kind. ...

On a question of Schmidt and Summerer concerning 3 -systems

Johannes Schleischitz (2020)

Communications in Mathematics

Similarity:

Following a suggestion of W.M. Schmidt and L. Summerer, we construct a proper 3 -system ( P 1 , P 2 , P 3 ) with the property ϕ ¯ 3 = 1 . In fact, our method generalizes to provide n -systems with ϕ ¯ n = 1 , for arbitrary n 3 . We visualize our constructions with graphics. We further present explicit examples of numbers ξ 1 , ... , ξ n - 1 that induce the n -systems in question.

On path-quasar Ramsey numbers

Binlong Li, Bo Ning (2014)

Annales Universitatis Mariae Curie-Sklodowska, sectio A – Mathematica

Similarity:

Let G 1 and G 2 be two given graphs. The Ramsey number R ( G 1 , G 2 ) is the least integer r such that for every graph G on r vertices, either G contains a G 1 or G ¯ contains a G 2 . Parsons gave a recursive formula to determine the values of R ( P n , K 1 , m ) , where P n is a path on n vertices and K 1 , m is a star on m + 1 vertices. In this note, we study the Ramsey numbers R ( P n , K 1 F m ) , where F m is a linear forest on m vertices. We determine the exact values of R ( P n , K 1 F m ) for the cases m n and m 2 n , and for the case that F m has no odd component. Moreover, we...

On the multiples of a badly approximable vector

Yann Bugeaud (2015)

Acta Arithmetica

Similarity:

Let d be a positive integer and α a real algebraic number of degree d + 1. Set α ̲ : = ( α , α ² , . . . , α d ) . It is well-known that c ( α ̲ ) : = l i m i n f q q 1 / d · | | q α ̲ | | > 0 , where ||·|| denotes the distance to the nearest integer. Furthermore, c ( α ̲ ) n - 1 / d c ( n α ̲ ) n c ( α ̲ ) for any integer n ≥ 1. Our main result asserts that there exists a real number C, depending only on α, such that c ( n α ̲ ) C n - 1 / d for any integer n ≥ 1.

Approximation properties of β-expansions

Simon Baker (2015)

Acta Arithmetica

Similarity:

Let β ∈ (1,2) and x ∈ [0,1/(β-1)]. We call a sequence ( ϵ i ) i = 1 0 , 1 a β-expansion for x if x = i = 1 ϵ i β - i . We call a finite sequence ( ϵ i ) i = 1 n 0 , 1 n an n-prefix for x if it can be extended to form a β-expansion of x. In this paper we study how good an approximation is provided by the set of n-prefixes. Given Ψ : 0 , we introduce the following subset of ℝ: W β ( Ψ ) : = m = 1 n = m ( ϵ i ) i = 1 n 0 , 1 n [ i = 1 n ( ϵ i ) / ( β i ) , i = 1 n ( ϵ i ) / ( β i ) + Ψ ( n ) ] In other words, W β ( Ψ ) is the set of x ∈ ℝ for which there exist infinitely many solutions to the inequalities 0 x - i = 1 n ( ϵ i ) / ( β i ) Ψ ( n ) . When n = 1 2 n Ψ ( n ) < , the Borel-Cantelli lemma tells us that the Lebesgue measure...

Hardness of embedding simplicial complexes in d

Jiří Matoušek, Martin Tancer, Uli Wagner (2011)

Journal of the European Mathematical Society

Similarity:

Let 𝙴𝙼𝙱𝙴𝙳 k d be the following algorithmic problem: Given a finite simplicial complex K of dimension at most k , does there exist a (piecewise linear) embedding of K into d ? Known results easily imply polynomiality of 𝙴𝙼𝙱𝙴𝙳 k 2 ( k = 1 , 2 ; the case k = 1 , d = 2 is graph planarity) and of 𝙴𝙼𝙱𝙴𝙳 k 2 k for all k 3 . We show that the celebrated result of Novikov on the algorithmic unsolvability of recognizing the 5-sphere implies that 𝙴𝙼𝙱𝙴𝙳 d d and 𝙴𝙼𝙱𝙴𝙳 ( d - 1 ) d are undecidable for each d 5 . Our main result is NP-hardness of 𝙴𝙼𝙱𝙴𝙳 2 4 and, more generally, of 𝙴𝙼𝙱𝙴𝙳 k d for all...

On n -thin dense sets in powers of topological spaces

Adam Bartoš (2016)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

A subset of a product of topological spaces is called n -thin if every its two distinct points differ in at least n coordinates. We generalize a construction of Gruenhage, Natkaniec, and Piotrowski, and obtain, under CH, a countable T 3 space X without isolated points such that X n contains an n -thin dense subset, but X n + 1 does not contain any n -thin dense subset. We also observe that part of the construction can be carried out under MA.