Related papers: A complexity theorem for the Novelli-Pak-Stoyanovs…
Let $SYT_{n}$ be the set of all standard Young tableaux with $n$ cells and $\leq_{weak}$ be Melnikov's the weak order on $SYT_n$. The aim of this paper is to introduce a conjecture, called the {\it property of inner tableau translation} and…
We consider the problem of computing the Euler characteristic of an abstract simplicial complex given by its vertices and facets. We show that this problem is #P-complete and present two new practical algorithms for computing Euler…
For a broad class of input-output maps, arguments based on the coding theorem from algorithmic information theory (AIT) predict that simple (low Kolmogorov complexity) outputs are exponentially more likely to occur upon uniform random…
In this paper we investigate the complexity of abduction, a fundamental and important form of non-monotonic reasoning. Given a knowledge base explaining the world's behavior it aims at finding an explanation for some observed manifestation.…
Vladimir Shpilrain and Jie-Tai Yu have asked for an effective algorithm to decide if two elements of C[x,y] are related by an automorphism of C[x,y]. We describe here an efficient algorithm that decides this question and finds the…
In this paper, two new stochastic algorithms for calculating parametric derivatives of the solution to the Smoluchowski coagulation equation are presented. It is assumed that the coagulation kernel is dependent on these parameters. The new…
This article starts with the fundamental theory of stochastic type convergence and the significance of uniform integrability in the context of expectation value. A novel probabilistic sampling kantorovich (PSK-operators) is established with…
We introduce hardness in relative entropy, a new notion of hardness for search problems which on the one hand is satisfied by all one-way functions and on the other hand implies both next-block pseudoentropy and inaccessible entropy, two…
In this article we demonstrate how algorithmic probability theory is applied to situations that involve uncertainty. When people are unsure of their model of reality, then the outcome they observe will cause them to update their beliefs. We…
We survey the diverse approaches to the notion of information content: from Shannon entropy to Kolmogorov complexity. The main applications of Kolmogorov complexity are presented namely, the mathematical notion of randomness (which goes…
We discuss a stochastic particle system consisting of a two-dimensional array of particles living in one space dimension. The stochastic evolution bears a certain similarity to Hammersley's process, and the particle interaction is governed…
While known algorithms for sensitivity analysis and parameter tuning in probabilistic networks have a running time that is exponential in the size of the network, the exact computational complexity of these problems has not been established…
We provide a concrete introduction to the topologised, graded analogue of an algebraic structure known as a plethory, originally due to Tall and Wraith. Stacey and Whitehouse showed this structure is present on the cohomology operations for…
The Murnaghan-Nakayama rule is the classical formula for computing the character table of S_n. Y. Roichman has recently discovered a rule for the Kazhdan-Lusztig characters of q-Hecke algebras of type A, which can also be used for the…
Young tableaux are ubiquitous in various branches of mathematics. There are two counting formulas for standard Young tableaux. The first involves a determinant and goes back to Frobenius and Young, and the second is the hook formula by…
We give a combinatorial proof of the skew Kostka analogue of the K-saturation theorem. More precisely, for any positive integer k, we give an explicit injection from the set of skew semistandard Young tableaux with skew shape…
A homotopy commutative algebra, or $C_{\infty}$-algebra, is defined via the Tornike Kadeishvili homotopy transfer theorem on the vector space generated by the set of Young tableaux with self-conjugated Young diagrams. We prove that this…
Some aspects of the predictability problem in dynamical systems are reviewed. The deep relation among Lyapunov exponents, Kolmogorov-Sinai entropy, Shannon entropy and algorithmic complexity is discussed. In particular, we emphasize how a…
We survey diverse approaches to the notion of information: from Shannon entropy to Kolmogorov complexity. Two of the main applications of Kolmogorov complexity are presented: randomness and classification. The survey is divided in two parts…
We derive combinatorial identities, involving the Bernoulli and Euler numbers, for the numbers of standard Young tableaux of certain skew shapes. This generalizes the classical formulas of D. Andre on the number of up-down permutations. The…