Related papers: Richard Stanley through a crystal lens and from a …
A practical approach is proposed to construct short presentations for Euclidean crystallographic groups in terms of generators and relations. For our purposes a short presentation is the one with a small number of short relators for a given…
We present a new geometric proof of Stanley's monotonicity theorem for lattice polytopes, using an interpretation of $\delta$-polynomials of lattice polytopes in terms of orbifold Chow rings.
The Kalman decomposition for Linear Quantum Stochastic Systems in the real quadrature operator representation, that was derived indirectly in [1] by the authors, is derived here directly, using the "one-sided symplectic" SVD-like…
This paper is the last of the series investigating renormalization group aspects of stochastic random matrices, including a Wigner-like disorder. We consider the equilibrium dynamics formalism that can be merged with the Ward identities…
We perform a systematic symmetry classification of the Markov generators of classical stochastic processes. Our classification scheme is based on the action of involutive symmetry transformations of a real Markov generator, extending the…
In this paper, we consider robust control using randomized algorithms. We extend the existing order statistics distribution theory to the general case in which the distribution of population is not assumed to be continuous and the order…
Given a set of integers with no three in arithmetic progression, we construct a Stanley sequence by adding integers greedily so that no arithmetic progression is formed. This paper offers two main contributions to the theory of Stanley…
We consider the Thompson-Stein group F(n_1,...,n_k) for integers n_1,...,n_k and k greater than 1. We highlight several differences between the cases k=1$ and k>1, including the fact that minimal tree-pair diagram representatives of…
This paper faces a central theme in applied statistics and information science, which is the assessment of the stochastic structure of rank-size laws in text analysis. We consider the words in a corpus by ranking them on the basis of their…
We study the N-step binary stationary ergodic Markov chain and analyze its differential entropy. Supposing that the correlations are weak we express the conditional probability function of the chain through the pair correlation function and…
We characterize, in an algebraic and in a diagrammatic way, Milnor string link invariants indexed by sequences where any index appears at most $k$ times, for any fixed $k\ge 1$. The algebraic characterization is given in terms of an…
Optimization algorithms can be interpreted through the lens of dynamical systems as the interconnection of linear systems and a set of subgradient nonlinearities. This dynamical systems formulation allows for the analysis and synthesis of…
Borel and Reutenauer (2006) showed, \emph{inter alia}, that a word $w$ of length $n>1$ is conjugate to a Christoffel word if and only if for $k=0,1, \dots , n-1$, $w$ has $k+1$ distinct circular factors of length $k$. Sturmian words are the…
The Euclidean Steiner problem is the problem of finding a set $St$, with the shortest length, such that $St \cup A$ is connected, where $A$ is a given set in a Euclidean space. The solutions $St$ to the Steiner problem will be called…
We study some combinatorial properties of the word metric of Thompson's group F in the standard two generator finite presentation. We explore connections between the tree pair diagram representing an element w of F, its normal form in the…
In this paper, we combine the operator splitting methodology for abstract evolution equations with that of stochastic methods for large-scale optimization problems. The combination results in a randomized splitting scheme, which in a given…
We evaluate the influence of different alphabet orderings on the Lyndon factorization of a string. Experiments with Pizza & Chili datasets show that for most alphabet reorderings, the number of Lyndon factors is usually small, and the…
The main theme of this paper is the enumeration of the occurrence of a pattern in words and permutations. We mainly focus on asymptotic properties of the sequence $f_r^v(k,n),$ the number of $n$-array $k$-ary words that contain a given…
We apply techniques introduced by Clerc, Kobayashi, Orsted and Pevzner to study the degenerate principal series of Sp(n,C). An explicit description of the K-types is provided and Knapp-Stein normalised operators are realised a symplectic…
Sparse inversion and classification problems are ubiquitous in modern data science and imaging. They are often formulated as non-smooth minimisation problems. In sparse inversion, we minimise, e.g., the sum of a data fidelity term and an…