相关论文: On C.T.C. Wall's suspension theorem

Clustering and closure coefficients are among the most widely applied indicators in the description of the topological structure of a network. Many distinct definitions have been proposed over time, particularly in the case of weighted…

This paper builds model-theoretic tools to detect changes in complexity among the simple theories. We develop a generalization of dividing, called shearing, which depends on a so-called context c. This leads to defining c-superstability, a…

This article presents a general solution to the problem of computational complexity. First, it gives a historical introduction to the problem since the revival of the foundational problems of mathematics at the end of the 19th century.…

A theory T is tight if different deductively closed extensions of T (in the same language) cannot be bi-interpretable. Many well-studied foundational theories are tight, including PA [Visser2006], ZF, Z2, and KM [enayat2017]. In this…

We develop the theory of CW(A)-complexes, which generalizes the classical theory of CW-complexes, keeping the geometric intuition of J.H.C. Whitehead's original theory. We obtain this way generalizations of classical results, such as…

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 initiate the theory of real noncommutative (nc) convex sets, the real case of the recent and profound complex theory developed by Davidson and Kennedy. The present paper focuses on the real case of the topics from the first several…

Paper contains description of the fields nonlinear modes successive quantization scheme. It is shown that the path integrals for absorption part of amplitudes are defined on the Dirac ($\d$-like) functional measure. This permits arbitrary…

This letter is about confinement in QCD. At the moment we have pictures of confinement to complete our understanding of the physics of strongly interacting particles, interaction which asks for confinement. As it is said in [1] : " In…

This paper gives a simple proof of a limit theorem for the lenght of the largest interval straddling a fixed number of i.i.d. points uniformly disributed on a unit interval. The key step in our argument is a classical theorem of Watson…

The problem of constructing maximal equiangular tight frames or SICs was raised by Zauner in 1998. Four years ago it was realized that the problem is closely connected to a major open problem in number theory. We discuss why such a…

We introduce the Insertion Chain Complex, a higher-dimensional extension of insertion graphs, as a new framework for analyzing finite sets of words. We study its topological and combinatorial properties, in particular its homology groups,…

We introduce the notion of confinement of decompositions for forms or vector of forms. The confinement, when it holds, lowers the number of parameters that one needs to consider, in order to find all the possible decompositions of a given…

In his 1979 paper Trotman proves, using the techniques of the Thom transversality theorem, that under some conditions on the dimensions of the manifolds under consideration, openness of the set of maps transverse to a stratification in the…

Given a finite nonempty sequence S of integers, write it as XY^k, where Y^k is a power of greatest exponent that is a suffix of S: this k is the curling number of S. The Curling Number Conjecture is that if one starts with any initial…

Controlled topology is one of the main tools for proving the isomorphism conjecture concerning the algebraic $K$-theory of group rings. In this article we dive into this machinery in two examples: when the group is infinite cyclic and when…

Taylor's theorem (and its variants) is widely used in several areas of mathematical analysis, including numerical analysis, functional analysis, and partial differential equations. This article explains how Taylor's theorem in its most…

In this Phd. thesis, a structural analysis of construction schemes is developed. The importance of this study will be justified by constructing several distinct combinatorial objects which have been of great interest in mathematics. We then…

The linear complexity and the $k$-error linear complexity of a binary sequence are important security measures for key stream strength. By studying binary sequences with the minimum Hamming weight, a new tool named as hypercube theory is…

We survey results on the formalization and independence of mathematical statements related to major open problems in computational complexity theory. Our primary focus is on recent findings concerning the (un)provability of complexity…