656 research outputs found
P?=NP as minimization of degree 4 polynomial, integration or Grassmann number problem, and new graph isomorphism problem approaches
While the P vs NP problem is mainly approached form the point of view of
discrete mathematics, this paper proposes reformulations into the field of
abstract algebra, geometry, fourier analysis and of continuous global
optimization - which advanced tools might bring new perspectives and approaches
for this question. The first one is equivalence of satisfaction of 3-SAT
problem with the question of reaching zero of a nonnegative degree 4
multivariate polynomial (sum of squares), what could be tested from the
perspective of algebra by using discriminant. It could be also approached as a
continuous global optimization problem inside , for example in
physical realizations like adiabatic quantum computers. However, the number of
local minima usually grows exponentially. Reducing to degree 2 polynomial plus
constraints of being in , we get geometric formulations as the
question if plane or sphere intersects with . There will be also
presented some non-standard perspectives for the Subset-Sum, like through
convergence of a series, or zeroing of fourier-type integral for some natural . The last discussed
approach is using anti-commuting Grassmann numbers , making nonzero only if has a Hamilton cycle. Hence,
the PNP assumption implies exponential growth of matrix representation of
Grassmann numbers. There will be also discussed a looking promising
algebraic/geometric approach to the graph isomorphism problem -- tested to
successfully distinguish strongly regular graphs with up to 29 vertices.Comment: 19 pages, 8 figure
Locally fitting hyperplanes to high-dimensional data
Problems such as data compression, pattern recognition and artificial intelligence often deal with a large data sample as observations of an unknown object. An effective method is proposed to fit hyperplanes to data points in each hypercubic subregion of the original data sample. Corresponding to a set of affine linear manifolds, the locally fitted hyperplanes optimally approximate the object in the sense of least squares of their perpendicular distances to the sample points. Its effectiveness and versatility are illustrated through approximation of nonlinear manifolds Möbius strip and Swiss roll, handwritten digit recognition, dimensionality reduction in a cosmological application, inter/extrapolation for a social and economic data set, and prediction of recidivism of criminal defendants. Based on two essential concepts of hyperplane fitting and spatial data segmentation, this general method for unsupervised learning is rigorously derived. The proposed method requires no assumptions on the underlying object and its data sample. Also, it has only two parameters, namely the size of segmenting hypercubes and the number of fitted hyperplanes for user to choose. These make the proposed method considerably accessible when applied to solving various problems in real applications
COMs: Complexes of Oriented Matroids
In his seminal 1983 paper, Jim Lawrence introduced lopsided sets and featured
them as asymmetric counterparts of oriented matroids, both sharing the key
property of strong elimination. Moreover, symmetry of faces holds in both
structures as well as in the so-called affine oriented matroids. These two
fundamental properties (formulated for covectors) together lead to the natural
notion of "conditional oriented matroid" (abbreviated COM). These novel
structures can be characterized in terms of three cocircuits axioms,
generalizing the familiar characterization for oriented matroids. We describe a
binary composition scheme by which every COM can successively be erected as a
certain complex of oriented matroids, in essentially the same way as a lopsided
set can be glued together from its maximal hypercube faces. A realizable COM is
represented by a hyperplane arrangement restricted to an open convex set. Among
these are the examples formed by linear extensions of ordered sets,
generalizing the oriented matroids corresponding to the permutohedra. Relaxing
realizability to local realizability, we capture a wider class of combinatorial
objects: we show that non-positively curved Coxeter zonotopal complexes give
rise to locally realizable COMs.Comment: 40 pages, 6 figures, (improved exposition
Hitting time for the continuous quantum walk
We define the hitting (or absorbing) time for the case of continuous quantum
walks by measuring the walk at random times, according to a Poisson process
with measurement rate . From this definition we derive an explicit
formula for the hitting time, and explore its dependence on the measurement
rate. As the measurement rate goes to either 0 or infinity the hitting time
diverges; the first divergence reflects the weakness of the measurement, while
the second limit results from the Quantum Zeno effect. Continuous-time quantum
walks, like discrete-time quantum walks but unlike classical random walks, can
have infinite hitting times. We present several conditions for existence of
infinite hitting times, and discuss the connection between infinite hitting
times and graph symmetry.Comment: 12 pages, 1figur
- …