English
Related papers

Related papers: Hyperplane mass partitions via relative equivarian…

200 papers

We construct a finite subgroup of Brauer-Manin obstruction for detecting the existence of integral points on integral models of homogeneous spaces of linear algebraic groups of multiplicative type. As application, the strong approximation…

Number Theory · Mathematics 2012-08-21 Dasheng Wei , Fei Xu

Let $G$ be a group and $H_1$,...,$H_s$ be subgroups of $G$ of indices $d_1$,...,$d_s$ respectively. In 1974, M. Herzog and J. Sch\"onheim conjectured that if $\{H_i\alpha_i\}_{i=1}^{i=s}$, $\alpha_i\in G$, is a coset partition of $G$, then…

Group Theory · Mathematics 2024-11-20 Fabienne Chouraqui

We employ methods from homotopy theory to define new obstructions to solutions of embedding problems. By using these novel obstructions we study embedding problems with non-solvable kernel. We apply these obstructions to study the…

Number Theory · Mathematics 2017-11-21 Magnus Carlson , Tomer M. Schlank

This article presents uniform random generators of plane partitions according to the size (the number of cubes in the 3D interpretation). Combining a bijection of Pak with the method of Boltzmann sampling, we obtain random samplers that are…

Combinatorics · Mathematics 2009-09-29 Olivier Bodini , Eric Fusy , Carine Pivoteau

Hypergraph partitioning is a fundamental optimization problem with applications in data management and other domains involving higher-order relations. In this paper, we study balanced hypergraph partitioning from the perspective of quantum…

Social and Information Networks · Computer Science 2026-05-05 Yiran Li , Y. Batuhan Yilmaz , Michael Silver , Zachary Vernec , Hans-Arno Jacobsen

The {\sc $c$-Balanced Separator} problem is a graph-partitioning problem in which given a graph $G$, one aims to find a cut of minimum size such that both the sides of the cut have at least $cn$ vertices. In this paper, we present new…

Data Structures and Algorithms · Computer Science 2010-11-22 Manjish Pal

We prove a generalization of the hyperplane inequality for intersection bodies, where volume is replaced by an arbitrary measure $\mu$ with even continuous density and sections are of arbitrary dimension $n-k,\ 1\le k <n.$ If $K$ is a…

Metric Geometry · Mathematics 2011-08-15 Alexander Koldobsky , Dan Ma

The Kronecker coefficient g_{\lambda \mu \nu} is the multiplicity of the GL(V)\times GL(W)-irreducible V_\lambda \otimes W_\mu in the restriction of the GL(X)-irreducible X_\nu via the natural map GL(V)\times GL(W) \to GL(V \otimes W),…

Computational Complexity · Computer Science 2013-06-10 Jonah Blasiak , Ketan D. Mulmuley , Milind Sohoni

There are various reasons why a naive analog of the Maeda conjecture has to fail for Drinfeld cusp forms. Focussing on double cusp forms and using the link found by Teitelbaum between Drinfeld cusp forms and certain harmonic cochains, we…

Number Theory · Mathematics 2021-03-25 Gebhard Boeckle , Peter Mathias Graef , Rudolph Perkins

As is known, the irreducible projective representations (Reps) of anti-unitary groups contain three different situations, namely, the real, the complex and quaternion types with torsion number 1,2,4 respectively. This subtlety increases the…

Mathematical Physics · Physics 2021-06-11 Zhen-Yuan Yang , Jian Yang , Chen Fang , Zheng-Xin Liu

We consider the problem of partitioning the edges of a graph into as few paths as possible. This is a~subject of the classic conjecture of Gallai and a recurring topic in combinatorics. Regarding the complexity of partitioning a graph…

Data Structures and Algorithms · Computer Science 2026-02-16 Tomáš Masařík , Michał Włodarczyk , Mehmet Akif Yıldız

We study the combinatorics of hyperplane arrangements over arbitrary fields. Specifically, we determine in which situation an arrangement and its reduction modulo a prime number have isomorphic lattices via the use of minimal strong…

Combinatorics · Mathematics 2021-04-05 Elisa Palezzato , Michele Torielli

We investigate a recent solution to the strong CP problem, obtaining a theta-angle of order unity, and show that a smooth trajectory of the massive eigenvector of a rank-one rotating mass matrix is consistent with the experimental data for…

High Energy Physics - Phenomenology · Physics 2012-01-25 Michael J Baker , S. T. Tsou

We present a new lower bound on the differential entropy rate of stationary processes whose sequences of probability density functions fulfill certain regularity conditions. This bound is obtained by showing that the gap between the…

Information Theory · Computer Science 2017-08-30 Meik Dörpinghaus

Let $X$ be a compact connected strongly pseudoconvex $CR$ manifold of real dimension 2n-1 in $\mathbb{C}^{N}$. It has been an interesting question to find an intrinsic smoothness criteria for the complex Plateau problem. For $n\ge 3$ and…

Differential Geometry · Mathematics 2012-03-08 Rong Du , Stephen Yau

We show that the minimal number of skewed hyperplanes that cover the hypercube $\{0,1\}^{n}$ is at least $\frac{n}{2}+1$, and there are infinitely many $n$'s when the hypercube can be covered with $n-\log_{2}(n)+1$ skewed hyperplanes. The…

Combinatorics · Mathematics 2025-10-06 Paata Ivanisvili , Ohad Klein , Roman Vershynin

In this paper, we show that given a weighted, directed planar graph $G$, and any $\epsilon >0$, there exists a polynomial time and $O(n^{\frac{1}{2}+\epsilon})$ space algorithm that computes the shortest path between two fixed vertices in…

Computational Complexity · Computer Science 2015-02-10 Diptarka Chakraborty , Raghunath Tewari

An odd deformation of a super Riemann surface $\mathcal S$ is a deformation of $\mathcal S$ by variables of odd parity. In this article we study the obstruction theory of these odd deformations $\mathcal X$ of $\mathcal S$. We view…

Algebraic Geometry · Mathematics 2018-08-15 Kowshik Bettadapura

The work of Oh and Park ([OP]) on the deformation problem of coisotropic submanifolds opened the possibility of studying a large and interesting class of foliations with some explicit geometric tools. These tools assemble into the structure…

Geometric Topology · Mathematics 2008-05-28 Noah Kieserman

Geometric Complexity Theory as initiated by Mulmuley and Sohoni in two papers (SIAM J Comput 2001, 2008) aims to separate algebraic complexity classes via representation theoretic multiplicities in coordinate rings of specific group…

Computational Complexity · Computer Science 2019-01-16 Julian Dörfler , Christian Ikenmeyer , Greta Panova