Related papers: The implicitization problem for $\phi: P^n --> (P^…
Perez proved some $L^2$ inequalities for closed convex hypersurfaces immersed in the Euclidean space $\mathbb{R}^{n+1}$, more generally, for closed hypersurfaces with non-negative Ricci curvature, immersed in an Einstein manifold. In this…
I shall describe a general model-theoretic task to construct expansions of pseudofinite structures and discuss several examples of particular relevance to computational complexity. Then I will present one specific situation where finding a…
We derive the implicit equations for certain parametric surfaces in three-dimensional projective space termed tensor product surfaces. Our method computes the implicit equation for such a surface based on the knowledge of the syzygies of…
We propose a hybrid image-space/object-space solution to the classical hidden surface removal problem: Given n disjoint triangles in Real^3 and p sample points (``pixels'') in the xy-plane, determine the first triangle directly behind each…
Let X and Y be curves over a finite field. In this article we explore methods to determine whether there is a rational map from Y to X by considering L-functions of certain covers of X and Y and propose a specific family of covers to…
We describe an effective landscape introduced in [1] for the analysis of Constraint Satisfaction problems, such as Sphere Packing, K-SAT and Graph Coloring. This geometric construction reexpresses these problems in the more familiar terms…
This article belongs to a series on geometric complexity theory (GCT), an approach to the P vs. NP and related problems through algebraic geometry and representation theory. The basic principle behind this approach is called the flip. In…
The paper presents an extension of the geometric quantization procedure to integrable, big-isotropic structures. We obtain a generalization of the cohomology integrality condition, we discuss geometric structures on the total space of the…
Solving Bayesian inverse problems typically involves deriving a posterior distribution using Bayes' rule, followed by sampling from this posterior for analysis. Sampling methods, such as general-purpose Markov chain Monte Carlo (MCMC), are…
We present a novel method to perform numerical integration over curved polyhedra enclosed by high-order parametric surfaces. Such a polyhedron is first decomposed into a set of triangular and/or rectangular pyramids, whose certain faces…
One of the main obstacles for developing flexible AI systems is the split between data-based learners and model-based solvers. Solvers such as classical planners are very flexible and can deal with a variety of problem instances and goals…
Current trends in the computer graphics community propose leveraging the massive parallel computational power of GPUs to accelerate physically based simulations. Collision detection and solving is a fundamental part of this process. It is…
We classify the centers of the quantized Weyl algebras that are PI and derive explicit formulas for the discriminants of these algebras over a general class of polynomial central subalgebras. Two different approaches to these formulas are…
Neural implicit surface representations have recently emerged as popular alternative to explicit 3D object encodings, such as polygonal meshes, tabulated points, or voxels. While significant work has improved the geometric fidelity of these…
The $P_1$--nonconforming quadrilateral finite element space with periodic boundary condition is investigated. The dimension and basis for the space are characterized with the concept of minimally essential discrete boundary conditions. We…
This thesis deals with the enumerative study of combinatorial maps, and its application to the enumeration of other combinatorial objects. Combinatorial maps, or simply maps, form a rich combinatorial model. They have an intuitive and…
We present new higher-order quadratures for a family of boundary integral operators re-derived using the approach introduced in [Kublik, Tanushev, and Tsai - J. Comp. Phys. 247: 279-311, 2013]. In this formulation, a boundary integral over…
Polynomial factorization is a fundamental problem in computational algebra. Over the past half century, a variety of algorithmic techniques have been developed to tackle different variants of this problem. In parallel, algebraic complexity…
Consider the rational map $\phi: \mathbb{P}^{n-1}_{\mathbf k} \stackrel{[f_0:\cdots: f_n]}{\longrightarrow} \mathbb{P}^{n}_{\mathbf k}$ defined by homogeneous polynomials $f_0,\dots,f_n$ of the same degree $d$ in a polynomial ring…
We propose implicit integrators for solving stiff differential equations on unit spheres. Our approach extends the standard backward Euler and Crank-Nicolson methods in Cartesian space by incorporating the geometric constraint inherent to…