English
Related papers

Related papers: No-dimensional Tverberg Partitions Revisited

200 papers

Three-dimensional $N^{th}$ order nodal Lagrangian tetrahedral finite elements ($P_N$ elements) can be generated using Pascal's tetrahedron $\mathcal{H}$ where each node in 3D element space corresponds to an entry in $\mathcal{H}$. For the…

Computational Geometry · Computer Science 2021-12-03 Mark W. Lohry

In this paper, we solve a separation of singularities problem in the Bergman space. More precisely, we show that if $P\subset \mathbb{C}$ is a convex polygon which is the intersection of $n$ half planes, then the Bergman space on $P$…

Analysis of PDEs · Mathematics 2021-04-13 Andreas Hartmann , Marcu-Antone Orsoni

The diametral dimension, $\Delta(E)$, and the approximate diametral dimension, $\delta(E)$ of an element $E$ of a large class of nuclear Fr\'echet spaces are set theoretically between the corresponding invariant of power series spaces…

Functional Analysis · Mathematics 2022-10-26 Nazlı Doğan

We develop a systematic framework for determining the nature of exceptional points of $n^{\rm th}$ order (EP$_n$s) in non-Hermitian (NH) systems, represented by complex square matrices. By expressing symmetry-preserving perturbations in the…

Mesoscale and Nanoscale Physics · Physics 2026-03-27 Ipsita Mandal

Locally isoperimetric $N$-partitions are partitions of the space $\mathbb R^d$ into $N$ regions with prescribed, finite or infinite measure, which have minimal perimeter (which is the $(d-1)$-dimensional measure of the interfaces between…

Analysis of PDEs · Mathematics 2023-12-22 Matteo Novaga , Emanuele Paolini , Vincenzo Maria Tortorelli

We consider the Minimum Convex Partition problem: Given a set P of n points in the plane, draw a plane graph G on P, with positive minimum degree, such that G partitions the convex hull of P into a minimum number of convex faces. We show…

Computational Geometry · Computer Science 2021-12-22 Nicolas Grelier

A plasmon of a bounded domain $\Omega\subset\mathbb{R}^n$ is a non-trivial bounded harmonic function on $\mathbb{R}^n\setminus\partial\Omega$ which is continuous at $\partial\Omega$ and whose exterior and interior normal derivatives at…

Mathematical Physics · Physics 2014-03-21 Daniel Grieser

We describe in this paper a geometric construction in the projective p-adic plane that gives, together with a suitable notion of p-adic convexity, some open subsets of P 2 .Q p / naturally endowed with a "Hilbert" distance and a transitive…

Geometric Topology · Mathematics 2016-10-05 Antonin Guilloux

The aim of this paper is to study the dimensions and standard part maps between the field of $p$-adic numbers ${{\mathbb Q}_p}$ and its elementary extension $K$ in the language of rings $L_r$. We show that for any $K$-definable set…

Logic · Mathematics 2020-02-25 Ningyuan Yao

Let $p$ be a polynomial in the non-commuting variables $(a,x)=(a_1,...,a_{g_a},x_1,...,x_{g_x})$. If $p$ is convex in the variables $x$, then $p$ has degree two in $x$ and moreover, $p$ has the form $p = L + \Lambda ^T \Lambda,$ where $L$…

Functional Analysis · Mathematics 2008-04-07 Damon M. Hay , J. William Helton , Adrian Lim , Scott McCullough

For every integer $k\geq 2$ and every $R>1$ one can find a dimension $n$ and construct a symmetric convex body $K\subset\mathbb{R}^n$ with $\text{diam}\,Q_{k-1}(K)\geq R\cdot\text{diam}\,Q_k(K)$, where $Q_k(K)$ denotes the $k$-convex hull…

Metric Geometry · Mathematics 2025-10-01 Davide Ravasini

We study properties of convex hulls of (co)adjoint orbits of compact groups, with applications to invariant theory and tensor product decompositions. The notion of partial convex hulls is introduced and applied to define two numerical…

Representation Theory · Mathematics 2024-02-22 Valdemar V. Tsanov

Andrews' $(k, i)$-singular overpartition function $\overline{C}_{k, i}(n)$ counts the number of overpartitions of $n$ in which no part is divisible by $k$ and only parts $\equiv \pm i\pmod{k}$ may be overlined. In recent times, divisibility…

Number Theory · Mathematics 2021-07-13 Ajit Singh , Rupam Barman

We consider the problem of reporting convex hull points in an orthogonal range query in two dimensions. Formally, let $P$ be a set of $n$ points in $\mathbb{R}^{2}$. A point lies on the convex hull of a point set $S$ if it lies on the…

Computational Geometry · Computer Science 2013-07-24 Jatin Agarwal , Nadeem Moidu , Kishore Kothapalli , Kannan Srinathan

$\renewcommand{\Re}{{\rm I\!\hspace{-0.025em} R}} \newcommand{\SetX}{\mathsf{X}} \newcommand{\eps}{\varepsilon} \newcommand{\VorX}[1]{\mathcal{V} \pth{#1}} \newcommand{\Polygon}{\mathsf{P}} \newcommand{\IntRange}[1]{[ #1 ]}…

Computational Geometry · Computer Science 2016-05-18 Sariel Har-Peled , Haim Kaplan , Micha Sharir

We develop techniques to convexify a set that is invariant under permutation and/or change of sign of variables and discuss applications of these results. First, we convexify the intersection of the unit ball of a permutation and…

Optimization and Control · Mathematics 2021-08-10 Jinhak Kim , Mohit Tawarmalani , Jean-Philippe P. Richard

We study collisions of massive pointlike particles in three dimensional anti-de Sitter space, generalizing the work on massless particles in [1]. We show how to construct exact solutions corresponding to the formation of either a black hole…

High Energy Physics - Theory · Physics 2017-02-01 Jonathan Lindgren

Let X be randomly chosen from {-1,1}^n, and let Y be randomly chosen from the standard spherical Gaussian on R^n. For any (possibly unbounded) polytope P formed by the intersection of k halfspaces, we prove that |Pr [X belongs to P] - Pr [Y…

Computational Complexity · Computer Science 2013-02-05 Prahladh Harsha , Adam Klivans , Raghu Meka

For $l,n \in \mathbb{N}$ we define tonal partition algebra $P^l_n$ over $\mathbb{Z}[\delta]$. We construct modules $\{ \Delta_{\underline{\mu}} \}_{\underline{\mu}}$ for $P^l_n$ over $\mathbb{Z}[\delta]$, and hence over any integral domain…

Representation Theory · Mathematics 2019-12-05 Chwas Ahmed , Paul Martin , Volodymyr Mazorchuk

Suppose $<A_i, \vec{c}_i>$ are planar (convex) H-polyhedra, that is, $A_i \in \mathbb{R}^{n_i \times 2}$ and $\vec{c}_i \in \mathbb{R}^{n_i}$. Let $P_i = \{\vec{x} \in \mathbb{R}^2 \mid A_i\vec{x} \leq \vec{c}_i \}$ and $n = n_1 + n_2$. We…

Computational Geometry · Computer Science 2007-05-23 Axel Simon , Andy King