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

Using the T-algebra machinery we show that, up to linear isomorphism, the only strictly convex homogeneous cones in $\Re^n$ with $n \geq 3$ are the 2-cones, also known as Lorentz cones or second order cones. In particular, this shows that…

It has recently been established by Below, De Loera, and Richter-Gebert that finding a minimum size (or even just a small) triangulation of a convex polyhedron is NP-complete. Their 3SAT-reduction proof is discussed.

This paper studies a notion of parameterized flatness in the enriched context: p-flatness where the parameter p stands for a class of presheaves. One obtains a completion of a category A by considering the category F_p(A) of p-flat…

A framework (a straight-line embedding of a graph into a normed space allowing edges to cross) is globally rigid if any other framework with the same edge lengths with respect to the chosen norm is an isometric copy. We investigate global…

The thesis concentrates on two problems in discrete geometry, whose solutions are obtained by analytic, probabilistic and combinatoric tools. The first chapter deals with the strong polarization problem. This states that for any sequence…

For an $(n-1)$-Auslander algebra $\Lambda$ with global dimension $n$, we give some necessary conditions for $\Lambda$ admitting a maximal $(n-1)$-orthogonal subcategory in terms of the properties of simple $\Lambda$-modules with projective…

We describe the semisimplification of the monoidal category of tilting modules for the algebraic group GL_n in characteristic p > 0. In particular, we compute the dimensions of the indecomposable tilting modules modulo p.

Let R be a family of n axis-parallel rectangles with packing number p-1, meaning that among any p of the rectangles, there are two with a non-empty intersection. We show that the union complexity of R is at most O(n+p^2), and that the…

We obtain an explicit formula for the best lower bound for the higher topological complexity, TC_k(P^n), of real projective space implied by mod 2 cohomology.

The complexity of representing a polynomial by a Read-Once Oblivious Algebraic Branching Program (ROABP) is highly dependent on the chosen variable ordering. Bhargava et al. prove that finding the optimal ordering is NP-hard, and provide…

We show that computing the lattice programming gap of the group problems is NP-hard when the dimension is a part of input. We also obtain lower and upper bounds for the gap in terms of the cost vector and the determinant of the lattice.

We introduce a 2-round stochastic constraint-satisfaction problem, and show that its approximation version is complete for (the promise version of) the complexity class AM. This gives a `PCP characterization' of AM analogous to the PCP…

The relaxation complexity $\mathrm{rc}(X)$ of the set of integer points $X$ contained in a polyhedron is the smallest number of facets of any polyhedron $P$ such that the integer points in $P$ coincide with $X$. It is a useful tool to…

In this paper, let $n\geq2$ be an integer, $P=diag(-I_{n-\kappa},I_\kappa,-I_{n-\kappa},I_\kappa)$ for some integer $\kappa\in[0, n-1)$, and $\Sigma \subset {\bf R}^{2n}$ be a partially symmetric compact convex hypersurface, i.e., $x\in…

We give upper bounds on the essential dimension of (quasi-)simple algebraic groups over an algebraically closed field that hold in all characteristics. The results depend on showing that certain representations are generically free. In…

We show that {\sc Heegaard Genus $\leq g$}, the problem of deciding whether a triangulated 3-manifold admits a Heegaard splitting of genus less than or equal to $g$, is NP-hard. The result follows from a quadratic time reduction of the…

For non-abelian simple objects in a unitary modular category, the density of their braid group representations, the #P-hard evaluation of their associated link invariants, and the BQP-completeness of their anyonic quantum computing models…

The $\{0,\frac{1}{2}\}$-closure of a rational polyhedron $\{ x \colon Ax \le b \}$ is obtained by adding all Gomory-Chv\'atal cuts that can be derived from the linear system $Ax \le b$ using multipliers in $\{0,\frac{1}{2}\}$. We show that…

We study geometric variations of the discriminating code problem. In the \emph{discrete version} of the problem, a finite set of points $P$ and a finite set of objects $S$ are given in $\mathbb{R}^d$. The objective is to choose a subset…

In this paper, let $n\geq2$ be an integer, $P=diag(-I_{n-\kappa},I_\kappa,-I_{n-\kappa},I_\kappa)$ for some integer $\kappa\in[0, n)$, and $\Sigma \subset {\bf R}^{2n}$ be a partially symmetric compact convex hypersurface, i.e., $x\in…