Related papers: A complexity theorem for the Novelli-Pak-Stoyanovs…
We extend work of McKay, Morse, and Wilf by giving exact formulas and asymptotic formulas for the number of skew Young tableaux T in two situations: (1) the "inside shape" and total number of cells of T are fixed, and (2) the inside shape…
The structure of many complex networks includes edge directionality and weights on top of their topology. Network analysis that can seamlessly consider combination of these properties are desirable. In this paper, we study two important…
Immanants are polynomial functions of n by n matrices attached to irreducible characters of the symmetric group S_n, or equivalently to Young diagrams of size n. Immanants include determinants and permanents as extreme cases. Valiant proved…
Boolean automata networks (aka Boolean networks) are space-time discrete dynamical systems, studied as a model of computation and as a representative model of natural phenomena. A collection of simple entities (the automata) update their…
Banderier, Marchal, and Wallner considered Young tableaux with walls, which are similar to standard Young tableaux, except that local decreases are allowed at some walls. In this work, we prove a conjecture of Fuchs and Yu concerning the…
The theory of computational complexity focuses on functions and, hence, studies programs whose interactive behavior is reduced to a simple question/answer pattern. We propose a broader theory whose ultimate goal is expressing and analyzing…
We devise an abstract, modular scheme to prove continuity of the Lyapunov exponents for a general class of linear cocycles. The main assumption is the availability of appropriate large deviation type (LDT) estimates which are uniform in the…
We study and derive algorithms for nonlinear eigenvalue problems, where the system matrix depends on the eigenvector, or several eigenvectors (or their corresponding invariant subspace). The algorithms are derived from an implicit…
Recently, a theoretical framework aimed at separating the roles of dynamics and topology in multi-dimensional systems has been developed (Gao et al, \textit{Nature}, Vol 530:307 (2016)). The validity of their method is assumed to hold…
We prove a realization theorem for rational functions of several complex variables which extends the main theorem of M. Bessmertnyi, "On realizations of rational matrix functions of several complex variables," in Vol. 134 of Oper. Theory…
Developing new ways to estimate probabilities can be valuable for science, statistics, and engineering. By considering the information content of different output patterns, recent work invoking algorithmic information theory has shown that…
We discuss ways in which tools from topology can be used to derive lower bounds for the circuit complexity of Boolean functions.
The objective of this paper is to study detectability, observability and related Lyapunov-type theorems of linear discrete-time time-varying stochastic systems with multiplicative noise. Some new concepts such as uniform detectability,…
We extend the decomposition theorem for numerically $K$-trivial varieties with log terminal singularities to the K\"ahler setting. Along the way we prove that all such varieties admit a strong locally trivial algebraic approximation, thus…
We discuss the geometry of orbit closures and the asymptotic behavior of Kronecker coefficients in the context of the Geometric Complexity Theory program to prove a variant of Valiant's algebraic analog of the P not equal to NP conjecture.…
We generalize the theory of ordering character triples, developed by Navarro and Sp\"ath, by taking into account the action of Galois automorphisms on characters. This new technique, together with previous results of Ladisch and Turull,…
In this paper, we propose a new convex approach to stability analysis of nonlinear systems with polynomial vector fields. First, we consider an arbitrary convex polytope that contains the equilibrium in its interior. Then, we decompose the…
We show how complexity theory can be introduced in machine learning to help bring together apparently disparate areas of current research. We show that this new approach requires less training data and is more generalizable as it shows…
We systematically study the moduli theory of symplectic varieties (in the sense of Beauville) which admit a resolution by an irreducible symplectic manifold. In particular, we prove an analog of Verbitsky's global Torelli theorem for the…
We consider the Frank-Wolfe algorithm for solving variational inequalities over compact, convex sets under a monotone $C^1$ operator and vanishing, nonsummable step sizes. We introduce a continuous-time interpolation of the discrete…