Related papers: Dynamical properties of critical exponent function…
We formulate and prove compensated compactness theorems concerning the limiting behaviour of wedge products of weakly convergent differential forms on closed Riemannian manifolds \`{a} la Robbin--Rogers--Temple [Trans. Amer. Math. Soc. 303…
In this paper we study acyclic colouring in the random subgraph $\mathit{G}$ of the complete graph $\mathit{K}_n$ on $\mathit{n}$ vertices where each edge is present with probability $\mathit{p}$; independent of the other edges. We show…
Lyapunov exponents characterize the chaotic nature of dynamical systems by quantifying the growth rate of uncertainty associated with the imperfect measurement of initial conditions. Finite-time estimates of the exponent, however,…
In Ising model on the simple cubic lattice, we describe the inverse temperature \beta in terms of the bare-mass M and study its critical behavior by the use of delta expansion from high temperature or large M side. In the vicinity of…
The driving force behind deep networks is their ability to compactly represent rich classes of functions. The primary notion for formally reasoning about this phenomenon is expressive efficiency, which refers to a situation where one…
The continuity problem, i.e., the question whether effective maps between effectively given topological spaces are effectively continuous, is reconsidered. In earlier work it was shown that this is always the case, if the effective map also…
We explain how to see finite combinatorics of preorders implicit in the {text} of basic topological definitions or arguments in (Bourbaki, General topology, Ch.I), and define a concise combinatorial notation such that complete definitions…
We define and investigate the property of being `exponent-critical' for a finite group. A finite group is said to be exponent-critical if its exponent is not the least common multiple of the exponents of its proper non-abelian subgroups. We…
It is our aim to establish a general analytic theory of asymptotic expansions of type f(x)=a_1 phi_1(x)+dots+ a_n phi_n(x)+o(phi_n(x)), x tends to x_0 (*), where the given ordered n-tuple of real-valued functions phi_1 dots,phi_n forms an…
A new method based on the R'-operation of the renormalization theory is proposed for the numerical calculation of the renormalization constants in the theory of critical behaviour. The problem of finding residues of the poles of the Green's…
Selection of descent direction at a point plays an important role in numerical optimization for minimizing a real valued function. In this article, a descent sequence is generated for the functions with bounded parameters to obtain a…
We study graph parameters whose associated edge-connection matrices have exponentially bounded rank growth. Our main result is an explicit construction of a large class of graph parameters with this property that we call mixed partition…
Recently Takens' Reconstruction Theorem was studied in the complex analytic setting by Forn{\ae}ss and Peters \cite{FP}. They studied the real orbits of complex polynomials, and proved that for non-exceptional polynomials ergodic properties…
We consider the family of one-dimensional maps arising from the contracting Lorenz attractors studied by Rovella. Benedicks-Carleson techniques were used by Rovella to prove that there is a one-parameter family of maps whose derivatives…
The phase diagram of a system with two order parameters, with ${\it n_1}$ and $n_2$ components, respectively, contains two phases, in which these order parameters are non-zero. Experimentally and numerically, these phases are often…
We show that certain determinantal functions of multiple matrices, when summed over the symmetries of the cube, decompose into functions of the original matrices. These are shown to be true in complete generality; that is, no properties of…
The presence of second-order smoothness for objective functions of optimization problems can provide valuable information about their stability properties and help us design efficient numerical algorithms for solving these problems. Such…
Here we prove critical exponents for Random Connections Models (RCMs) with random marks. The vertices are given by a marked Poisson point process on $\mathbb{R}^d$ and an edge exists between any pair of vertices independently with a…
The notion of a firmly nonexpansive mapping is central in fixed point theory because of attractive convergence properties for iterates and the correspondence with maximal monotone operators due to Minty. In this paper, we systematically…
Cover's function counting theorem is a milestone in the theory of artificial neural networks. It provides an answer to the fundamental question of determining how many binary assignments (dichotomies) of $p$ points in $n$ dimensions can be…