Related papers: Complexity bounds on supermesh construction for qu…

Amoebas are projections of complex algebraic varieties in the algebraic torus under a Log-absolute value map, which have connections to various mathematical subjects. While amoebas of hypersurfaces have been intensively studied in recent…

The intrinsic structure of binary fields poses a challenging complexity problem from both hardware and software point of view. Motivated by applications to modern cryptography, we describe some simple techniques aimed at performing…

We propose an off-shell construction of three-dimensional N = 3 and N = 4 superconformal Abelian Chern-Simons theories in the projective superspace formalism. We also construct coupling terms among the gauge fields and matter…

We study the conditions under which N=(1,1) generalized sigma models support an extension to N=(2,2). The enhanced supersymmetry is related to the target space complex geometry. Concentrating on a simple situation, related to Poisson sigma…

Graph-based signal processing techniques have become essential for handling data in non-Euclidean spaces. However, there is a growing awareness that these graph models might need to be expanded into `higher-order' domains to effectively…

Let $X$ be a hypersurface in $\mathbb{P}^N$ with $N\geq 3$ defined over a finite field. The main result of this note is the classification, up to projective equivalence, of hypersurfaces $X$ as above without a linear component when the…

Parity is ubiquitous, but not always identified as a simplifying tool for computations. Using parity, having in mind the example of the bosonic/fermionic Fock space, and the framework of Z_2-graded (super) algebra, we clarify relationships…

We formulate N-fold supersymmetry in quantum mechanical matrix models. As an example, we construct general two-by-two Hermitian matrix 2-fold supersymmetric quantum mechanical systems. We find that there are two inequivalent such systems,…

One of the major issues in the computational mechanics is to take into account the geometrical complexity. To overcome this difficulty and to avoid the expensive mesh generation, geometrically unfitted methods, i.e. the numerical methods…

Sheaf cohomology or, more generally, higher direct images of coherent sheaves along proper morphisms are central to modern algebraic geometry. However, the computation of these objects is a non-trivial and expensive task which easily…

Given an $n \times d$ dimensional dataset $A$, a projection query specifies a subset $C \subseteq [d]$ of columns which yields a new $n \times |C|$ array. We study the space complexity of computing data analysis functions over such…

In this paper we establish the optimal multilinear restriction estimate for n-1 hypersurfaces with some curvature, where $n$ is the dimension of the underlying space. The result is sharp up to the endpoint and the role of curvature is made…

We consider spline functions over simplicial meshes in $\RR^n$. We assume that the spline pieces join together with some finite order of smoothness but the pieces themselves are infinitely smooth. Such splines can have extra orders of…

Using 4D, N=1 superfield techniques, a discussion of the 6D sigma-model possessing simple supersymmetry is given. Two such approaches are described. Foremost it is shown that the simplest and most transparent description arises by use of a…

We present a simple yet general and efficient approach to representation of computational meshes. Meshes are represented as sets of mesh entities of different topological dimensions and their incidence relations. We discuss a…

The over-segmentation into superpixels is an important preprocessing step to smartly compress the input size and speed up higher level tasks. A superpixel was traditionally considered as a small cluster of square-based pixels that have…

Complexity of patterns is a key information for human brain to differ objects of about the same size and shape. Like other innate human senses, the complexity perception cannot be easily quantified. We propose a transparent and universal…

We establish a lower bound for the complexity of multiplying two skew polynomials. The lower bound coincides with the upper bound conjectured by Caruso and Borgne in 2017, up to a log factor. We present algorithms for three special cases,…

We show that any polyhedron forming a topological ball with an even number of quadrilateral sides can be partitioned into O(n) topological cubes, meeting face to face. The result generalizes to non-simply-connected polyhedra satisfying an…

This paper solves the problem of computing conformal structures of general 2-manifolds represented as triangle meshes. We compute conformal structures in the following way: first compute homology bases from simplicial complex structures,…