相关论文: Asymptotic dimension, decomposition complexity, an…
Geometric property (T) was defined by Willett and Yu, first for sequences of graphs and later for more general discrete spaces. Increasing sequences of graphs with geometric property (T) are expanders, and they are examples of coarse spaces…
Analogy has been shown to be important in many key cognitive abilities, including learning, problem solving, creativity and language change. For cognitive models of analogy, the fundamental computational question is how its inherent…
A method is proposed for the characterisation of the entropy of cellular structures, based on the compactivity concept for granular packings. Hamiltonian-like volume functions are constructed both in two and in three dimensions, enabling…
New notions of the complexity function C(epsilon;t,s) and entropy function S(epsilon;t,s) are introduced to describe systems with nonzero or zero Lyapunov exponents or systems that exhibit strong intermittent behavior with ``flights'',…
To prove presence of chaos for fractals, a new mathematical concept of abstract similarity is introduced. As an example, the space of symbolic strings on a finite number of symbols is proved to possess the property. Moreover, Sierpinski…
We discuss some problems related to dimensional reductions of gravity theories to two-dimensional and one-dimensional dilaton gravity models. We first consider the most general cylindrical reductions of the four-dimensional gravity and…
We give a global geometric decomposition of continuously differentiable vector fields on $\mathbb{R}^n$. More precisely, given a vector field of class $\mathcal{C}^{1}$ on $\mathbb{R}^{n}$, and a geometric structure on $\mathbb{R}^n$, we…
We introduce a method of rigorous analysis of the location and type of complex singularities for nonlinear higher order PDEs as a function of the initial data. The method is applied to determine rigorously the asymptotic structure of…
We explore and refine techniques for estimating the Hausdorff dimension of exceptional sets and their diffeomorphic images. Specifically, we use a variant of Schmidt's game to deduce the strong C^1 incompressibility of the set of badly…
We study the class of potential games that are also graphical games with respect to a given graph $G$ of connections between the players. We show that, up to strategic equivalence, this class of games can be identified with the set of…
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…
The game of SET is a popular card game in which the objective is to form Sets using cards from a special deck. In this paper we study single- and multi-round variations of this game from the computational complexity point of view and…
The classical Brody's theorem asserts the equivalence between two notions of hyperbolicity for compact complex spaces, one named after Kobayashi and one expressed in terms of lack of non constant holomorphic entire functions (compactness is…
Generic computability has been studied in group theory and we now study it in the context of classical computability theory. A set A of natural numbers is generically computable if there is a partial computable function f whose domain has…
The aim of this work is to expose some asymptotic series associated to some expressions involving the volume of the n-dimensional unit ball. All proofs and the methods used for improving the classical inequalities announced in the final…
By resorting to the vector space structure of finite games, skew-symmetric games (SSGs) are proposed and investigated as a natural subspace of finite games. First of all, for two player games, it is shown that the skew-symmetric games form…
These three topics are an attempt to explicate some curiosities of the inverse problem of representation theory (i.e. having a set of operators to describe the "correct" algebraic object, which is represented by them) on simple examples…
We introduce graphical complexes of groups, which can be thought of as a generalisation of Coxeter systems with 1-dimensional nerves. We show that these complexes are strictly developable, and we equip the resulting Basic Construction with…
Network or graph structures are ubiquitous in the study of complex systems. Often, we are interested in complexity trends of these system as it evolves under some dynamic. An example might be looking at the complexity of a food web as…
Some aspects of the development of physics and the mathematics set one think about relation between complex numbers and reality around us. If number to spot as the relation of two quantities, from the fact of existence of complex numbers…