English
Related papers

Related papers: On the paving size of a subfactor

200 papers

We canonically associate to any planar algebra two type II_{\infty} factors M_{+} and M_{-}. The subfactors constructed previously by the authors in a previous paper are isomorphic to compressions of M_{+} and M_{-} to finite projections.…

Operator Algebras · Mathematics 2009-11-26 A. Guionnet , V. F. R. Jones , D. Shlyakhtenko

In the preceding decade, Andrews and Newman resurrected the concept of a `minimal excludant' of a partition ($mex$, for short), namely, the least positive missing integer in a partition. Subsequently, several authors have not only studied…

Combinatorics · Mathematics 2026-04-15 Subhash Chand Bhoria , Pramod Eyyunni , Subhrangsu Santra

For positive integers $m$ and $s$, let $\mathbf{m}_s$ stand for the $s$-th tuple $(m,\ldots,m)$. We show that, for large enough $s$, the higher topological complexity $TC_s$ of an even dimensional real projective space $RP^m$ is…

Algebraic Topology · Mathematics 2016-10-28 Jesus Gonzalez , Darwin Gutierrez , Adriana Lara

Many graph problems were first shown to be fixed-parameter tractable using the results of Robertson and Seymour on graph minors. We show that the combination of finite, computable, obstruction sets and efficient order tests is not just one…

Computational Complexity · Computer Science 2013-05-15 Michael R. Fellows , Bart M. P. Jansen

Given a convex $n$-gon $P$ and a positive integer $m$ such that $3\le m\le n-1$, let $Q$ denote the largest area convex $m$-gon contained in $P$. We are interested in the minimum value of $\Delta(Q)/\Delta(P)$, the ratio of the areas of…

Combinatorics · Mathematics 2021-04-27 Dan Ismailescu , Min Jung Kim , Eric Wang

Schnyder characterized planar graphs in terms of order dimension. Brightwell and Trotter proved that the dimension of the vertex-edge-face poset $\Pvef{M}$ of a planar map $M$ is at most four. In this paper we investigate cases where…

Combinatorics · Mathematics 2009-06-03 Stefan Felsner , Johan Nilsson

In this paper, we characterize planar point sets that can be partitioned into disjoint polygons of arbitrarily specified sizes. We provide an algorithm to construct such a partition, if it exists, in polynomial time. We show that this…

Computational Geometry · Computer Science 2016-05-19 Ajit Arvind Diwan , Bodhayan Roy

$ \newcommand{\epsA}{\Mh{\delta}} \newcommand{\Re}{\mathbb{R}} \newcommand{\reals}{\mathbb{R}} \newcommand{\SetX}{\mathsf{X}} \renewcommand{\P}{P} \newcommand{\diam}{\Delta} \newcommand{\Mh}[1]{#1} \newcommand{\query}{q}…

Computational Geometry · Computer Science 2025-02-18 Sariel Har-Peled , Eliot W. Robson

A subequation on an open subset $X\subset \mathbb R^n$ is a subset $F$ of the space of $2$-jets on $X$ with certain properties. A smooth function is said to be $F$-subharmonic if all of its $2$-jets lie in $F$, and using the viscosity…

Analysis of PDEs · Mathematics 2021-05-13 Julius Ross , David Witt Nyström

We prove that for each integer $r\geq 2$, there exists a constant $C_r>0$ with the following property: for any $0<\varepsilon \leq 1/2$ and any graph $G$ with clique number at most $r,$ there is a partition of $V(G)$ into at most…

Combinatorics · Mathematics 2024-12-02 António Girão , Toby Insley

For a finite collection of graphs ${\cal F}$, the ${\cal F}$-M-DELETION problem consists in, given a graph $G$ and an integer $k$, decide whether there exists $S \subseteq V(G)$ with $|S| \leq k$ such that $G \setminus S$ does not contain…

Data Structures and Algorithms · Computer Science 2021-03-12 Julien Baste , Ignasi Sau , Dimitrios M. Thilikos

Let $m \in \mathbb{N}$ be large. We show that there exist infinitely many primes $q_{1}< \cdot\cdot\cdot < q_{m+1}$ such that \[ q_{m+1}-q_{1}=O(e^{7.63m}) \] and $q_{j}+2$ has at most \[ \frac{7.36m}{\log 2} + \frac{4\log m}{\log 2} + 21…

Number Theory · Mathematics 2025-07-17 Bin Chen

We prove inequality (1) for the modified Steiner functional A(M), which extends the notion of the integral of mean curvature for convex surfaces.We also establish an exression for A(M) in terms of an integral over all hyperplanes…

High Energy Physics - Theory · Physics 2009-10-28 G. K. Savvidy , R. Schneider

Let $T$ be a measure preserving $\mathbb{Z}^\ell$-action on the probability space $(X,{\mathcal B},\mu),$ $q_1,\dots,q_m:{\mathbb R}\to{\mathbb R}^\ell$ vector polynomials, and $f_0,\dots,f_m\in L^\infty(X)$. For any $\epsilon > 0$ and…

Dynamical Systems · Mathematics 2022-05-16 Andreas Koutsogiannis , Anh N. Le , Joel Moreira , Florian K. Richter

Given a graph $G$ on $n$ vertices, for which $m$ is it possible to partition the edge set of the $m$-fold complete graph $mK_n$ into copies of $G$? We show that there is an integer $m_0$, which we call the \emph{partition modulus of $G$},…

Combinatorics · Mathematics 2014-08-05 Peter J. Cameron , Sebastian M. Cioabă

For a normal projective variety $X$, the $\bf Q$-factoriality defect $\sigma(X)$ is defined to be the rank of the quotient of the group of Weil divisors by the subgroup of Cartier ones. We prove a slight improvement of a topological formula…

Algebraic Geometry · Mathematics 2026-03-24 Seung-Jo Jung , Morihiko Saito

We call a subfactor trivial if it is isomorphic with the obvious inclusion of N into matrices over N. We prove the existence of type II_1 factors M without non-trivial finite index subfactors. Equivalently, every M-M-bimodule with finite…

Operator Algebras · Mathematics 2009-01-20 Stefaan Vaes

We extend some results of [BF12] on subfactor projections to show that the projection of a free factor B to the free factor complex of the free factor A is well-defined with uniformly bound diameter, unless either A is contained in B or A…

Geometric Topology · Mathematics 2016-01-20 Samuel J. Taylor

In this article we prove that for any orthonormal system $(\vphi_j)_{j=1}^n \subset L_2$ that is bounded in $L_{\infty}$, and any $1 < k <n$, there exists a subset $I$ of cardinality greater than $n-k$ such that on $\spa\{\vphi_i\}_{i \in…

Functional Analysis · Mathematics 2008-01-24 Olivier Guedon , Shahar Mendelson , Alain Pajor , Nicole Tomczak-Jaegermann

We prove that if $f:\mathbb{R}^n\to\mathbb{R}$ is convex and $A\subset\mathbb{R}^n$ has finite measure, then for any $\varepsilon>0$ there is a convex function $g:\mathbb{R}^n\to\mathbb{R}$ of class $C^{1,1}$ such that $\mathcal{L}^n(\{x\in…

Classical Analysis and ODEs · Mathematics 2020-11-23 Daniel Azagra , Piotr Hajłasz