相关论文: Property testing and expansion in cubical complexe…

The conventional definition of a topological metric over a space specifies properties that must be obeyed by any measure of "how separated" two points in that space are. Here it is shown how to extend that definition, and in particular the…

An $\epsilon$-test for any non-trivial property (one for which there are both satisfying inputs and inputs of large distance from the property) should use a number of queries that is at least inversely proportional in $\epsilon$. However,…

In order to deal with the systematic verification with uncertain infromation in possibility theory, Li and Li \cite{li12} introduced model checking of linear-time properties in which the uncertainty is modeled by possibility measures. Xue,…

We consider the task of testing properties of Boolean functions that are invariant under linear transformations of the Boolean cube. Previous work in property testing, including the linearity test and the test for Reed-Muller codes, has…

The shape of homogeneous, generic, smooth convex bodies as described by the Euclidean distance with nondegenerate critical points, measured from the center of mass represents a rather restricted class M_C of Morse-Smale functions on S^2.…

We present a general and user-extensible equality checking algorithm that is applicable to a large class of type theories. The algorithm has a type-directed phase for applying extensionality rules and a normalization phase based on…

We study property testing of (di)graph properties in bounded-degree graph models. The study of graph properties in bounded-degree models is one of the focal directions of research in property testing in the last 15 years. However, despite…

In graph property testing the task is to distinguish whether a graph satisfies a given property or is "far" from having that property, preferably with a sublinear query and time complexity. In this work we initiate the study of property…

A multiplication on the 2D cohomological Hall algebra (CoHA) of the variety of commuting matrices was described by Schiffman and Vasserot. This construction can be generalised to other varieties that exist as the zero-locus of a function on…

One of the most fundamental questions in graph property testing is to characterize the combinatorial structure of properties that are testable with a constant number of queries. We work towards an answer to this question for the…

In this report, we present work towards a framework for modeling and checking behavior of spatially distributed component systems. Design goals of our framework are the ability to model spatial behavior in a component oriented, simple and…

Using the generalized entropies which depend on two parameters we propose a set of quantitative characteristics derived from the Information Geometry based on these entropies. Our aim, at this stage, is modest, as we are first constructing…

We provide a short introduction to the field of topological data analysis and discuss its possible relevance for the study of complex systems. Topological data analysis provides a set of tools to characterise the shape of data, in terms of…

We consider the problem of hypothesis testing in the situation where the first hypothesis is simple and the second one is local one-sided composite. We describe the choice of the thresholds and the power functions of different tests when…

The topic of this thesis is the application of distributive laws between comonads to the theory of cyclic homology. Explicitly, our main aims are: 1) To study how the cyclic homology of associative algebras and of Hopf algebras in the…

In this paper, we construct a seven-term exact sequence involving the cohomology groups of a group extension. Although the existence of such a sequence can be derived using spectral sequence arguments, there is little knowledge about some…

We describe new explicit examples of moduli spaces of Bridgeland semistable objects on surfaces, parametrizing objects whose numerical class agrees with the class of a point. This follows ideas of Tramel and Xia, using stability conditions…

In this paper we consider a problem of searching a space of predictive models for a given training data set. We propose an iterative procedure for deriving a sequence of improving models and a corresponding sequence of sets of non-linear…

We study extensions of double groupoids in the sense of \cite{AN2} and show some classical results of group theory extensions in the case of double groupoids. For it, given a double groupoid $(\mathcal{B}; \mathcal{V},\mathcal{H};…

The linear complexity is a measure for the unpredictability of a sequence over a finite field and thus for its suitability in cryptography. In 2012, Diem introduced a new figure of merit for cryptographic sequences called expansion…