Related papers: Algorithmic complexity and soficness of shifts in …
For a subshift over a finite alphabet, a measure of the complexity of the system is obtained by counting the number of nonempty cylinder sets of length $n$. When this complexity grows exponentially, the automorphism group has been shown to…
For a projective hyperplane arrangement, we study sufficient conditions in terms of combinatorial data for ESV-calculability of the monodromy eigenspaces of the first Milnor fiber cohomology for eigenvalues of order $m>1$. This can be…
Shape constraints, such as non-negativity, monotonicity, convexity or supermodularity, play a key role in various applications of machine learning and statistics. However, incorporating this side information into predictive models in a hard…
The massive non-relativistic free particle in d-1 space dimensions has an action with a surprizing non-linearly realized SO(d,2) symmetry. This is the simplest example of a host of diverse one-time-physics systems with hidden SO(d,2)…
This paper depicts an algorithm for solving the Decision Boolean Satisfiability Problem using the binary numerical properties of a Special Decision Satisfiability Problem, parallel execution, object oriented, and short termination. The two…
We consider the entire characteristic functions of order 2 and we prove some decomposition theorems in a multidimensional case. We show that the lack of zeros of the density function is a necessary but not a sufficient (as in the…
We study the surface roughness of prototype models displaying self-organized criticality (SOC) and their noncritical variants in one dimension. For SOC systems, we find that two seemingly equivalent definitions of surface roughness yields…
We define a new class of shift spaces which contains a number of classes of interest, like Sturmian shifts used in discrete geometry. We show that this class is closed under two natural transformations. The first one is called conjugacy and…
We study a two-dimensional generalization of the classical Bin Packing problem, denoted as 2D Demand Bin Packing. In this context, each bin is a horizontal timeline, and rectangular tasks (representing electric appliances or computational…
The $2$-admissibility of a graph is a promising measure to identify real-world networks which have an algorithmically favourable structure. In contrast to other related measures, like the weak/strong $2$-colouring numbers or the maximum…
We introduce a new notion of complexity of functions and we show that it has the following properties: (i) it governs a PAC Bayes-like generalization bound, (ii) for neural networks it relates to natural notions of complexity of functions…
We consider the problem of optimizing a high-dimensional convex function using stochastic zeroth-order queries. Under sparsity assumptions on the gradients or function values, we present two algorithms: a successive component/feature…
An approach to find a weak form of shadowing is developed. We consider homeomorphisms of a compact metric space. It is proved that every pseudotrajectory with sufficiently small errors contains at least one subsequence that can be shadowed…
In this paper, we study the problem of optimizing a two-layer artificial neural network that best fits a training dataset. We look at this problem in the setting where the number of parameters is greater than the number of sampled points.…
Polynomial identities of two-dimensional Novikov algebras are studied over the complex field $\mathbb{C}$. We determine minimal generating sets for the T-ideals of the polynomial identities and linear bases for the corresponding relatively…
Complex network topologies and hyperbolic geometry seem specularly connected, and one of the most fascinating and challenging problems of recent complex network theory is to map a given network to its hyperbolic space. The Popularity…
We show that any semi-calibration of degree 2 is locally induced by a smooth almost complex structure. We provide some applications of this result in the regularity theory for semi-calibrated 2-currents
This article provides a method for constructing invariants and semi-invariants of a binary $N$-ic form over a field $k$ characteristics $0$ or $p > N$. A practical and broadly applicable sufficient condition for ensuring nontriviality of…
The Lie-Poisson algebra so(N+1) and some of its contractions are used to construct a family of superintegrable Hamiltonians on the ND spherical, Euclidean, hyperbolic, Minkowskian and (anti-)de Sitter spaces. We firstly present a…
Certifying nonnegativity of polynomials is a well-known NP-hard problem with direct applications spanning non-convex optimization, control, robotics, and beyond. A sufficient condition for nonnegativity is the Sum of Squares (SOS) property,…