相关论文: Hyperplane mass partitions via relative equivarian…

The Satisfactory Partition problem consists in deciding if the set of vertices of a given undirected graph can be partitioned into two nonempty parts such that each vertex has at least as many neighbours in its part as in the other part.…

We provide a degree condition on a regular $n$-vertex graph $G$ which ensures the existence of a near optimal packing of any family $\mathcal H$ of bounded degree $n$-vertex $k$-chromatic separable graphs into $G$. In general, this degree…

The Unfriendly Partition Problem asks whether it is possible to split the vertex set of an infinite graph $G$ into two parts so that every vertex has at least as many neighbors in the other part than on its own. Despite the uncountable…

In his 1990 Inventiones paper, P. Jones characterized subsets of rectifiable curves in the plane, using a multiscale sum of what is now known as Jones $\beta$-numbers, numbers measuring flatness in a given scale and location. This work was…

We consider two algorithmic problems concerning sub-semigroups of Heisenberg groups and, more generally, two-step nilpotent groups. The first problem is Intersection Emptiness, which asks whether a finite number of given finitely generated…

The Grassmannian, which is the manifold of all $k$-dimensional subspaces in the Euclidean space $\mathbb{R}^n$, was decomposed through three equivalent methods connecting combinatorial geometries, Schubert cells and convex polyhedra by…

A classical open problem in combinatorial geometry is to obtain tight asymptotic bounds on the maximum number of k-level vertices in an arrangement of n hyperplanes in d dimensions (vertices with exactly k of the hyperplanes passing below…

Let $G=(V,E)$ be a bipartite graph embedded in a plane (or $n$-holed torus). Two subgraphs of $G$ differ by a {\it $Z$-transformation} if their symmetric difference consists of the boundary edges of a single face---and if each subgraph…

This paper proposes a two-level restricted additive Schwarz (RAS) method for multiscale PDEs, built on top of a multiscale spectral generalized finite element method (MS-GFEM). The method uses coarse spaces constructed from optimal local…

Following from a question of Wheeler, why does the Hamiltonian constraint ${\cal H}$ of GR have the particular form it does? A first answer, by Hojman, Kucha\v{r} and Teitelboim, is that using embeddability into spacetime as a principle…

For a degree d self branched covering of the 2-sphere, a notable combinatorial invariant is an integer partition of 2d -- 2, consisting of the multiplicities of the critical points. A finer invariant is the so called Hurwitz passport. The…

If a convex body $K \subset \mathbb{R}^n$ is covered by the union of convex bodies $C_1, \ldots, C_N$, multiple subadditivity questions can be asked. Two classical results regard the subadditivity of the width (the smallest distance between…

Let $\mathfrak{g} = \bigoplus_{i \in \mathbb{Z} /m \mathbb{Z}} \mathfrak{g}_i$ be a periodically graded semisimple complex Lie algebra. In this note, we give a uniform proof of the recent result by W. de Graaf and H. V. L\^e that the…

For integers $N\geq 3$ and $g\geq 1$, we study bounds on the cardinality of the set of points of order dividing $N$ lying on a hyperelliptic curve of genus $g$ embedded in its jacobian using a Weierstrass point as base point. This leads us…

Let $c(G)$ denote the circumference of a graph $G$, i.e., the number of vertices in its longest cycle. For positive integers $n$ and $k$ with $n>k$, let $\varGamma(n;k)$ be the class of graphs of order $n$ with $c(G) = n-k$ such that every…

We prove that if $G$ is an abelian group and $H_1x_1,\dots,H_{k}x_k$ is an irredundant (minimal) cover of $G$ with cosets, then $$|G:\bigcap_{i=1}^{k}H_{i}|=2^{O(k)}.$$ This bound is the best possible up to the constant hidden in the…

The Hidden Subgroup Problem (HSP) is a computational problem which includes as special cases integer factorization, the discrete logarithm problem, graph isomorphism, and the shortest vector problem. The celebrated polynomial-time quantum…

We prove the GGS conjecture (1993), due to Gerstenhaber, Giaquinto, and Schack, which gives a particularly simple explicit quantization of classical r-matrices for Lie algebras gl(n) in terms of an element R satisfying the quantum…

In this paper we give a method to associate a graph with an arbitrary density matrix referred to a standard orthonormal basis in the Hilbert space of a finite dimensional quantum system. We study the related issues like classification of…

We prove a number field analogue of W. M. Schmidt's conjecture on the intersection of weighted badly approximable vectors and use this to prove an instance of a conjecture of An, Guan and Kleinbock. Namely, let $G := SL_2(\mathbb{R}) \times…