相关论文: Testing the Existence of a Supporting Plane
Contextuality is a foundational phenomenon underlying key differences between quantum theory and classical realistic descriptions of the world. Here we propose an experimental test which is capable of revealing contextuality in all qutrit…
We study the geometry of spaces of planes on smooth complete intersections of three quadrics, with a view toward rationality questions.
An equivalence relation in the set of all square binary matrices is described in this work. It is discussed a combinatoric problem about finding the cardinal number and the elements of the factor set according to this relation. We examine…
A classical approach to investigate a closed projective scheme $W$ consists of considering a general hyperplane section of $W$, which inherits many properties of $W$. The inverse problem that consists in finding a scheme $W$ starting from a…
A jet algorithm must specify how to (re-)combine different partons or towers into a single four-vector. Various recombination schemes have been used experimentally to examine the transverse energy profile of jets in hadron colliders.…
Let $S$ be a finite set of points in the plane that are in convex position. We present an algorithm that constructs a plane $\frac{3+4\pi}{3}$-spanner of $S$ whose vertex degree is at most 3. Let $\Lambda$ be the vertex set of a finite…
Oblique images are aerial photographs taken at oblique angles to the earth's surface. Projections of vector and other geospatial data in these images depend on camera parameters, positions of the geospatial entities, surface terrain,…
We give a proof of openness of versality using coherent functors. As an application, we streamline Artin's criterion for algebraicity of a stack. We also introduce multi-step obstruction theories, employing them to produce obstruction…
We give an algorithm for testing uniformity of distributions supported on hypergrids $[m_1] \times \cdots \times [m_n]$, which makes $\smash{\widetilde{O}(\text{poly}(m)\sqrt{n}/\epsilon^2)}$ many queries to a subcube conditional sampling…
This paper improves the algorithms based on supporting halfspaces and quadratic programming for convex set intersection problems in our earlier paper in several directions. First, we give conditions so that much smaller quadratic programs…
In this paper, an iterative method for real-time hybrid testing (RTHT) is proposed. The method seeks to iteratively balance the interface conditions between the physical and numerical substructures by controlling the periodic demand of the…
In trajectory planning and control design for unmanned air vehicles, highly simplified models are typically used to represent the vehicle dynamics and the operating environment. The goal of this work is to perform real-time, but realistic…
Given a probability measure on the unit disk, we study the problem of deciding whether, for some threshold probability, this measure is supported near a real algebraic variety of given dimension and bounded degree. We call this "testing the…
In the Partially Embedded Planarity problem, we are given a graph $G$ together with a topological drawing of a subgraph $H$ of $G$. The task is to decide whether the drawing can be extended to a drawing of the whole graph such that no two…
A problem that is frequently encountered in a variety of mathematical contexts, is to find the common invariant subspaces of a single, or set of matrices. A new method is proposed that gives a definitive answer to this problem. The key idea…
We introduce and discuss, through a computational algebraic geometry approach, the automatic reasoning handling of propositions that are simultaneously true and false over some relevant collections of instances. A rigorous, algorithmic…
Pairwise comparison matrices are frequently applied in multi-criteria decision making. A weight vector is called efficient if no other weight vector is at least as good in approximating the elements of the pairwise comparison matrix, and…
Given a real algebraic curve, embedded in projective space, we study the computational problem of deciding whether there exists a hyperplane meeting the curve in real points only. More generally, given any divisor on such a curve, we may…
A very simple heuristic approach to the unfolding problem will be described. An iterative algorithm starts with an empty histogram and every iteration aims to add one entry to this histogram. The entry to be added is selected according to a…
We present a necessary and sufficient condition for a 3 by 3 matrix to be unitarily equivalent to a symmetric matrix with complex entries, and an algorithm whereby an arbitrary 3 by 3 matrix can be tested. This test generalizes to a…