Related papers: A complexity theorem for the Novelli-Pak-Stoyanovs…
We generalize the Robinson-Schensted-Knuth algorithm to the insertion of two row arrays of multisets. This generalization leads to new enumerative results that have representation theoretic interpretations as decompositions of centralizer…
In this paper a new proof is given for the supermodularity of information content. Using the decomposability of the information content an algorithm is given for discovering the Markov network graph structure endowed by the pairwise Markov…
There are two well known tasks, related to Newton polyhedra: to study invariants of singularities in terms of their Newton polyhedra, and to describe Newton polyhedra of resultants and discriminants. We introduce so called resultantal…
This is a survey of results on positivity of vector bundles, inspired by the Brunn-Minkowski and Pr\'ekopa theorems. Applications to complex analysis, K\"ahler geometry and algebraic geometry are also discussed.
This work is concerned with some properties of the Young-Fibonacci insertion algorithm and its relation with Fomin's growth diagrams. It also investigates a relation between the combinatorics of Young-Fibonacci tableaux and the study of…
We survey the problem of deciding the stability or stabilizability of uncertain linear systems whose region of uncertainty is a polytope. This natural setting has applications in many fields of applied science, from Control Theory to…
This work develops some technology for accessing the loop expansion of the Kontsevich integral of a knot. The setting is an application of the LMO invariant to certain surgery presentations of knots by framed links in the solid torus. A…
The theory of pictures between posets is known to encode much of the combinatorics of symmetric group representations and related topics such as Young diagrams and tableaux. Many reasons, com-binatorial (e.g. since semi-standard tableaux…
A conjecture connecting Lyapunov exponents of coupled map lattices and the node theorem is presented. It is based on the analogy between the linear stability analysis of extended chaotic states and the Schr\"odinger problem for a particle…
In many classification tasks there is a requirement of monotonicity. Concretely, if all else remains constant, increasing (resp. decreasing) the value of one or more features must not decrease (resp. increase) the value of the prediction.…
This short note shows how the Novikov conjecture for mapping class groups follows from a theorem of Kato and a result theorem of Hamenstadt.
This thesis deals with three different aspects of the combinatorics of permutations. In the first two papers, two flavours of pattern avoiding permutations are examined; and in the third paper Young tableaux, which are closely related to…
We give new lower bounds for the (higher) topological complexity of a space, in terms of the Lusternik-Schnirelmann category of a certain auxiliary space. We also give new lower bounds for the rational topological complexity of a space, and…
In this paper, we prove the integrality conjecture for quotient stacks arising from weakly symmetric representations of reductive groups. Our main result is a decomposition of the cohomology of the stack into finite-dimensional components…
We present the theory of tensors with Young tableau symmetry as an efficient computational tool in dealing with the polynomial first integrals of a natural system in classical mechanics. We relate a special kind of such first integrals,…
Different 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…
We outline the proof of a conjecture of Kontsevich on the isomorphism between the group of polynomial symplectomorphisms in $2n$ variables and the group of automorphisms of the $n$-th Weyl algebra over complex numbers. Our proof uses…
In this paper, we use the KK-theory of Kasparov to prove exactness of sequences relating the K-theory of a real C^*-algebra and of its complexification (generalizing results of Boersema). We use this to relate the real version of the…
Due to M\"{u}ller's theorem, the Kolmogorov complexity of a string was shown to be equal to its quantum Kolmogorov complexity. Thus there are no benefits to using quantum mechanics to compress classical information. The quantitative amount…
We study a probabilistic variant of the r-th sequential parametrized topological complexity, which bounds this classical invariant from below and measures the difficulty in constructing permissive parametrized motion planning algorithms. On…