Related papers: Hyperplane mass partitions via relative equivarian…
Let $1\leq i \leq k < n$ be integers. We prove the following exact inequalities for any convex body $K\subset\mathbb{R}^n$ with centroid at the origin, and any $k$-dimensional subspace $E\subset \mathbb{R}^n$: \begin{align*} &V_i \big(…
A decade ago two groups of authors, Karasev, Hubard and Aronov, and Blagojevi\'c and Ziegler, have shown that the regular convex partitions of a Euclidean space into $n$ parts yield a solution to the generalised Nandakumar and Ramana-Rao…
In this paper, extending the recent work of authors with Calles Loperena and Dimitrijevi\'c Blagojevi\'c, we give a general and complete treatment of a problem of partition of mass assignments with prescribed arrangements of hyperplanes on…
We construct a family of countexamples to a conjecture of Galvin [5], which stated that for any $n$-vertex, $d$-regular graph $G$ and any graph $H$ (possibly with loops), \[\hom(G,H) \leq \max\left\lbrace\hom(K_{d,d}, H)^{\frac{n}{2d}},…
A driving question in (quantum) cohomology of flag varieties is to find non-recursive, positive combinatorial formulas for expressing the product of two classes in a particularly nice basis, called the Schubert basis. Bertram,…
It was shown in \cite{FPV} that the classification of $n$-component systems of conservation laws possessing a third-order Hamiltonian structure reduces to the following algebraic problem: classify $n$-planes $H$ in $\wedge^2(V_{n+2})$ such…
Klein and Williams developed an obstruction theory for the homotopical equivariant fixed point problem, which asks whether an equivariant map can be deformed, through an equivariant homotopy, into another map with no fixed points…
Applications of harmonic analysis on finite groups were recently introduced to measure partition problems, with a variety of equipartition types by convex fundamental domains obtained as the vanishing of prescribed Fourier transforms.…
Given a finite CW complex $K$, we use a version of the Goodwillie-Weiss tower to formulate an obstruction theory for embedding $K$ into a Euclidean space $\mathbb{R}^d$. For $2$-dimensional complexes in $\mathbb{R}^4$, a geometric analogue…
We address the problem, previously considered by Ginocchio and Haxton (G-H), of the number of states for three identical particles in a single j-shell with angular momentum J=j. G-H solved this problem in the context of the quantum Hall…
Radiative corrections with new heavy particles coupling to Higgs doublets destabilize the electroweak scale and require an ad-hoc counterterm cancelling the large loop contribution. If the mass scale m1 of these new particles in in the TeV…
Let $K$ be a convex body in $\mathbb{R}^n$ (i.e., a compact convex set with nonempty interior). Given a point $p$ in the interior of $K$, a hyperplane $h$ passing through $p$ is called barycentric if $p$ is the barycenter of $K \cap h$. In…
We introduce a two-level hybrid restricted additive Schwarz (RAS) preconditioner for heterogeneous steady-state convection-diffusion equations at high P\'{e}clet numbers. Our construction builds on the multiscale spectral generalized finite…
We accept the implicit challenge of A. Uhlmann in his 1994 paper, "Parallel Lifts and Holonomy along Density Operators: Computable Examples Using O(3)-Orbits," by, in fact, computing the holonomy invariants for rotations of certain n-level…
The graph partition problem is the problem of partitioning the vertex set of a graph into a fixed number of sets of given sizes such that the sum of weights of edges joining different sets is optimized. In this paper we simplify a known…
The coloured Tverberg theorem was conjectured by B\'ar\'any, Lov\'{a}sz and F\"uredi and asks whether for any d+1 sets (considered as colour classes) of k points each in R^d there is a partition of them into k colourful sets whose convex…
In the first part of this paper, we consider, in the context of an arbitrary hyperplane arrangement, the map between compactly supported cohomology to the usual cohomology of a local system. A formula (i.e., an explicit algebraic de Rham…
The graph partitioning problem is a well-known NP-hard problem. In this paper, we formulate a 0-1 quadratic integer programming model for the graph partitioning problem with vertex weight constraints and fixed vertex constraints, and…
The problem of the existence of an equi-partition of a curve in $\R^n$ has recently been raised in the context of computational geometry. The problem is to show that for a (continuous) curve $\Gamma : [0,1] \to \R^n$ and for any positive…
Rounding has proven to be a fundamental tool in theoretical computer science. By observing that rounding and partitioning of $\mathbb{R}^d$ are equivalent, we introduce the following natural partition problem which we call the {\em secluded…