相关论文: NP-hardness of computing PL geometric category in …

We derive a formula which is a lower bound on the dimension of trivariate splines on a tetrahedral partition which are continuously differentiable of order $r$ in large enough degree. While this formula may fail to be a lower bound on the…

The half-maximal supergravity theories in three dimensions, which have local $SO(8)\xz SO(n)$ and rigid SO(8,n) symmetries, are discussed in a superspace setting starting from the superconformal theory. The on-shell theory is obtained by…

The Cohn-Elkies linear programming (LP) bound for sphere packing is known to be sharp in dimensions 8 and 24 but in no other dimension above 2. We investigate why by examining three independent necessary conditions for LP sharpness, drawn…

Let $P_{\lambda\Sigma_n}$ be the Ehrhart polynomial associated to an intergal multiple $\lambda$ of the standard symplex $\Sigma_n \subset \mathbb{R}^n$. In this paper we prove that if $(M, L)$ is an $n$-dimensional polarized toric manifold…

We consider a simplicial complex generaliztion of a result of Billera and Meyers that every nonshellable poset contains the smallest nonshellable poset as an induced subposet. We prove that every nonshellable $2$-dimensional simplicial…

In this paper we establish a natural definition of Lusternik-Schnirelmann category for simplicial complexes via the well known notion of contiguity. This category has the property of being homotopy invariant under strong equivalences, and…

We derive upper and lower bounds on the gradients of Wachspress coordinates defined over any simple convex d-dimensional polytope P. The bounds are in terms of a single geometric quantity h_*, which denotes the minimum distance between a…

For a smooth complex projective variety, the rank of the N\'eron-Severi group is bounded by the Hodge number h^{1,1}. Varieties with rk NS = h^{1,1} have interesting properties, but are rather sparse, particularly in dimension 2. We discuss…

We consider the problem of partitioning a graph into a non-fixed number of non-overlapping subgraphs of maximum density. The density of a partition is the sum of the densities of the subgraphs, where the density of a subgraph is its average…

We prove a general lower bound on the average-case complexity of Shellsort: the average number of data-movements (and comparisons) made by a $p$-pass Shellsort for any incremental sequence is $\Omega (pn^{1 + 1/p})$ for every $p$. The proof…

We confirm, in dimension two, Blocki's conjectures on sharp lower bounds for Bergman kernels of tube domains. To that end, we verify a broader class of $L^p$-Mahler conjectures due to Berndtsson and the authors, where $p=1$ are Blocki's…

We represent minimal upper gradients of Newtonian functions, in the range $1\le p<\infty$, by maximal directional derivatives along "generic" curves passing through a given point, using plan-modulus duality and disintegration techniques. As…

The nondeterministic advice complexity of the P-selective sets is known to be exactly linear. Regarding the deterministic advice complexity of the P-selective sets--i.e., the amount of Karp--Lipton advice needed for polynomial-time machines…

Arguments on PL,(=piecewise linear) topology work over any ordered field in the same way as over the real field, and those on differential topology do over a real closed field R in an o-minimal structure that expands (R,<,0,1,+,cdot). One…

We investigate the parameterized complexity of several problems formalizing cluster identification in graphs. In other words we ask whether a graph contains a large enough and sufficiently connected subgraph. We study here three relaxations…

We study random 2-dimensional complexes in the Linial - Meshulam model and prove that for the probability parameter satisfying $$p\ll n^{-46/47}$$ a random 2-complex $Y$ contains several pairwise disjoint tetrahedra such that the 2-complex…

Second-order superintegrable systems in dimensions two and three are essentially classified. With increasing dimension, however, the non-linear partial differential equations employed in current methods become unmanageable. Here we propose…

We consider the first family of $\Hcurl$-conforming Ned\'el\'ec finite elements on tetrahedral meshes. Spectral approximation ($p$-version) is achieved by keeping the mesh fixed and raising the polynomial degree $p$ uniformly in all mesh…

For $i= 1,2$, let $G_i$ be cocompact groups of isometries of hyperbolic space $\Hyp^n$ of real dimension $n$, $n \geq 3$. Let $H_i \subset G_i$ be infinite index quasiconvex subgroups satisfying one of the following conditions: 1) limit set…

The orthogonality dimension of a graph $G$ over $\mathbb{R}$ is the smallest integer $k$ for which one can assign a nonzero $k$-dimensional real vector to each vertex of $G$, such that every two adjacent vertices receive orthogonal vectors.…