Related papers: Extremal sequences of polynomial complexity

We characterize the bipartite graphs that minimize the (first-degree based) entropy, among all bipartite graphs of given size, or given size and (upper bound on the) order. The extremal graphs turn out to be complete bipartite graphs, or…

The extremal function $ex(n, P)$ is the maximum possible number of ones in any 0-1 matrix with $n$ rows and $n$ columns that avoids $P$. A 0-1 matrix $P$ is called minimally non-linear if $ex(n, P) = \omega(n)$ but $ex(n, P') = O(n)$ for…

We formalise, in Coq, the opening sections of Parity Complexes [Street1991] up to and including the all important excision of extremals algorithm. Parity complexes describe the essential combinatorial structure exhibited by simplexes, cubes…

Inspired by the bad scientist who keeps repeating an experiment 20 times to get a single outcome with $p < 0.05$, we consider matrices $A \in \mathbb{R}^{n \times n}$ whose rows are normalized in $\ell^2$ and for which $2^{-n}\sum_{x \in…

Let $X$ be a compact Riemann surface of genus $\geq 2$ of constant negative curvature -1. An extremal disk is an embedded (resp. covering) disk of maximal (resp. minimal) radius. A surface containing an extremal disk is an {\em extremal…

An $(r, s)$-formation is a concatenation of $s$ permutations of $r$ letters. If $u$ is a sequence with $r$ distinct letters, then let $\mathit{Ex}(u, n)$ be the maximum length of any $r$-sparse sequence with $n$ distinct letters which has…

In this paper we develop combinatorial techniques for the case of string algebras with the aim to give a characterization of string complexes with infinite minimal projective resolution. These complexes will be called \textit{periodic…

The goal of this paper is two-fold: 1. We review classical and recent measures of serial extremal dependence in a strictly stationary time series as well as their estimation. 2. We discuss recent concepts of heavy-tailed time series,…

We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…

This note answers extremal questions like: what is the maximum number of edges in a graph of order n, which belongs to some hereditary property. The same question is answered also for the spectral radius and other similar parameters.

We investigate the conjugacy growth of finitely generated linear groups. We show that finitely generated non-virtually-solvable subgroups of GL_d have uniform exponential conjugacy growth and in fact that the number of distinct polynomials…

Given a probability vector $x$ with its components sorted in non-increasing order, we consider the closed ball ${\mathcal{B}}^p_\epsilon(x)$ with $p \geq 1$ formed by the probability vectors whose $\ell^p$-norm distance to the center $x$ is…

The lower spectral radius of a set of $d \times d$ matrices is defined to be the minimum possible exponential growth rate of long products of matrices drawn from that set. When considered as a function of a finite set of matrices of fixed…

We prove the existence of a limit shape and give its explicit description for certain probability distribution on signatures (or highest weights for unitary groups). The distributions have representation theoretic origin-they encode…

Let $F$ be a fixed field of characteristic zero containing an element $i$ such that $i^2 = -1$. In this paper we consider finite dimensional superalgebras over $F$ endowed with a pseudoautomorphism $p$ and we investigate the asymptotic…

In this article, we introduce a notion of an exponential matrix, which is a polynomial matrix with exponential properties, and a notion of an equivalence relation of two exponential matrices, and then we initiate to study classifying…

We study the maximum modulus set, $\mathcal{M}(p)$, of a polynomial $p$. We are interested in constructing $p$ so that $\mathcal{M}(p)$ has certain exceptional features. Jassim and London gave a cubic polynomial $p$ such that…

Enumerating the number of times one word occurs in another is a much-studied combinatorial subject. By utilizing a method that we call ``lexicographic extreme referencing'', we provide a formula for computing occurrences of one binary word…

An extremal element $x$ in a Lie algebra $\mathfrak{g}$ is an element for which the space $[x, [x, \mathfrak{g}]]$ is contained in the linear span of $x$. Long root elements in classical Lie algebras are examples of extremal elements. Lie…

We use ergodic theory to prove a quantitative version of a theorem of M. A. Berger and Y. Wang, which relates the joint spectral radius of a set of matrices to the spectral radii of finite products of those matrices. The proof rests on a…