Related papers: Algebraic degrees of stretch factors in mapping cl…

Let $\mathcal{L}$ be a finite-dimensional semisimple Lie algebra of rank $N$ over an algebraically closed field of characteristic $0$. Associated to $\mathcal{L}$ is a family of polynomial folding maps…

An even factor of $G$ is a spanning subgraph $F$ such that every vertex in $F$ has a nonzero even degree. Note that $\delta(G)\geq2$ is a trivial necessary condition for a graph to have an even factor, where $\delta(G)$ is the minimum…

Answering an open question from 2007, we construct infinite $k$-crossing-critical families of graphs that contain vertices of any prescribed odd degree, for any sufficiently large~$k$. To answer this question, we introduce several…

Every irreducible outer automorphism of the free group of rank r is topologically represented by an irreducible train track map $f$ on some graph $\Gamma$ of rank r. Moreover, $f$ can always be written as a composition of folds and a graph…

Graded-division algebras are building blocks in the theory of finite-dimensional associative algebras graded by a group G. If G is abelian, they can be described, using a loop construction, in terms of central simple graded-division…

A classical result of Koml\'os, S\'ark\"ozy and Szemer\'edi states that every $n$-vertex graph with minimum degree at least $(1/2+ o(1))n$ contains every $n$-vertex tree with maximum degree $O(n/\log{n})$ as a subgraph, and the bounds on…

The contribution of this work is to provide tables of Salem numbers with trace -3 and small degrees, namely degrees 2d = 34, 36, 38, and 40. The implemented method also generates a list of totally positive polynomials of degrees d = 17, 18,…

We prove two mixed versions of the Discrete Nodal Theorem of Davies et. al. [3] for bounded degree graphs, and for three-connected graphs of fixed genus $g$. Using this we can show that for a three-connected graph satisfying a certain…

We introduce a family of maps generating continued fractions where the digit $1$ in the numerator is replaced cyclically by some given non-negative integers $(N_1,\ldots,N_m)$. We prove the convergence of the given algorithm, and study the…

We give explicit pseudo-Anosov homeomorphisms with vanishing Sah-Arnoux-Fathi invariant. Any translation surface whose Veech group is commensurable to any of a large class of triangle groups is shown to have an affine pseudo-Anosov…

We introduce a class of orbits which may have $0$ Lyapunov exponents, but still demonstrate some sensitivity to initial conditions. We construct a countable Markov partition with a finite-to-one almost everywhere induced coding, and which…

We show that the set of $m \times m$ complex skew-symmetric matrix polynomials of odd grade $d$, i.e., of degree at most $d$, and (normal) rank at most $2r$ is the closure of the single set of matrix polynomials with the certain, explicitly…

If A is a graded connected algebra then we define a new invariant, polydepth A, which is finite if $Ext_A^*(M,A) \neq 0$ for some A-module M of at most polynomial growth. Theorem 1: If f : X \to Y is a continuous map of finite category, and…

We study ruled submanifolds of Euclidean space. First, to each (parametrized) ruled submanifold $\sigma$, we associate an integer-valued function, called degree, measuring the extent to which $\sigma$ fails to be cylindrical. In particular,…

Let $F$ be an algebraically closed field of characteristic zero, and $G$ be a finite abelian group. If $A=\oplus_{g\in G} A_g$ is a $G$-graded algebra, we study degree-inverting involutions on $A$, i.e., involutions $*$ on $A$ satisfying…

We introduce the classes of descendingly flexible and descendingly alternative algebras over an arbitrary field $\mathbb{F}$. We suggest a new method based on the sequence of differences between the dimensions of the linear spans of words,…

We prove, that every connected graph with $s$ vertices of degree 3 and $t$ vertices of degree at least~4 has a spanning tree with at least ${2\over 5}t +{1\over 5}s+\alpha$ leaves, where $\alpha \ge {8\over 5}$. Moreover, $\alpha \ge 2$ for…

We introduce a method to embed edge-colored graphs into families of expander graphs, which generalizes a framework developed by Dragani\'c, Krivelevich, and Nenadov (2022). As an application, we show that each family of sufficiently…

Given a hypersurface in the complex projective $n$-space we prove several known formulas for the degree of its polar map by purely algebro-geometric methods. Furthermore, we give formulas for the degree of its polar map in terms of the…

In this paper, we provide upper and lower bounds on the crossing numbers of dense graphs on surfaces, which match up to constant factors. First, we prove that if $G$ is a dense enough graph with $m$ edges and $\Sigma$ is a surface of genus…