Related papers: Almost resolvable even cycle systems of $(K_u \tim…
In this paper we show that certain universal homology classes which are fundamental in topology are algebraic. To be specific, the products of Eilenberg-MacLane spaces ${\cal K}_{2q} \equiv K({\Bbb Z},2) \times K({\Bbb Z}, 4) \times ...…
We give a proof of the Acyclicity Conjecture stated by Broussous and Schneider in [BrouSch2017]. As a consequence, we obtain an exact resolution of every admissible representation on each Bernstein block of ${\rm GL}(N)$ associated to a…
A special family of solvable five-vertex model is introduced on a square lattice. In addition to the usual nearest neighbor interactions, the vertices defining the model also interact alongone of the diagonals of the lattice. Such family of…
Recently, examples of an index theory for KMS states of circle actions were discovered, \cite{CPR2,CRT}. We show that these examples are not isolated. Rather there is a general framework in which we use KMS states for circle actions on a…
This paper is a significant contribution to a general programme aimed to classify all projective irreducible representations of finite simple groups over an algebraically closed field, in which the image of at least one element is…
Gallai asked in 1984 if any $k$-critical graph on $n$ vertices contains at least $n$ distinct $(k-1)$-critical subgraphs. The answer is trivial for $k\leq 3$. Improving a result of Stiebitz, Abbott and Zhou proved in 1995 that for all…
Bondy and Vince showed that every graph with minimum degree at least three contains two cycles of lengths differing by one or two.We prove the following average degree counterpart that every $n$-vertex graph $G$ with at least $\frac52(n-1)$…
Denote by $\lambda K_v$ the complete graph of order $v$ with multiplicity $\lambda$. Let $\lambda K_v-\lambda K_w-\lambda K_u$ be the graph obtained from $\lambda K_v$ by the removal of the edges of two vertex disjoint complete…
For a closed smooth manifold $M$ admitting a symplectic structure, we define a smooth topological invariant $Z(M)$ using almost-K\"ahler metrics, i.e. Riemannian metrics compatible with symplectic structures. We also introduce $Z(M,…
The MEG (minimum equivalent graph) problem is, given a directed graph, to find a small subset of the edges that maintains all reachability relations between nodes. The problem is NP-hard. This paper gives a proof that, for graphs where each…
Motivated by the controllability/reachability problems for switched linear control systems and some classes of nonlinear (mechanical) control systems we address a related problem of existence of a cyclic vector for an associative (matrix)…
Let $k \geq 2$ be an integer. Kouider and Lonc proved that the vertex set of every graph $G$ with $n \geq n_0(k)$ vertices and minimum degree at least $n/k$ can be covered by $k - 1$ cycles. Our main result states that for every $\alpha >…
We prove almost sure ergodic theorems for a class of systems called quasistatic dynamical systems. These results are needed, because the usual theorem due to Birkhoff does not apply in the absence of invariant measures. We also introduce…
Recently, Alon initiated the study of graph codes and their linear variants in analogy to the study of error correcting codes in theoretical computer science. Alon related the maximum density of a linear graph code which avoids images of a…
We consider quasinormal modes with complex energies from the point of view of the theory of quasi-exactly solvable (QES) models. We demonstrate that it is possible to find new potentials which admit exactly solvable or QES quasinormal modes…
We present a unified treatment of exact solutions for a class of four quantum mechanical models, namely the singular anharmonic potential, the generalized quantum isotonic oscillator, the soft-core Coulomb potential, and the…
We show that one can define and effectively compute Stallings graphs for quasi-convex subgroups of automatic groups (\textit{e.g.} hyperbolic groups or right-angled Artin groups). These Stallings graphs are finite labeled graphs, which are…
In this paper we survey the almost sure central limit theorem and its functional form (quenched) for stationary and ergodic processes. For additive functionals of a stationary and ergodic Markov chain these theorems are known under the…
Infinite families of multi-indexed orthogonal polynomials are discovered as the solutions of exactly solvable one-dimensional quantum mechanical systems. The simplest examples, the one-indexed orthogonal polynomials, are the infinite…
The graphs $D(k,q)$ have connected components $CD(k,q)$ giving the best known bounds on extremal problems with {\em forbidden\/} even cycles, and are denser than the well-known graphs of Lubotzky, Phillips, Sarnak and Margulis. Despite…