Related papers: Tissus alg\'ebriques exceptionnels
We prove a sufficient condition for a finite clique complex to collapse to a $k$-dimensional complex, and use this to exhibit thresholds for $(k+1)$-collapsibility in a sparse random clique complex. In particular, if every strongly…
Let $\mathcal{A} \rightarrow S$ be an abelian scheme over an irreducible variety over $\mathbb{C}$ of relative dimension $g$. For any simply-connected subset $\Delta$ of $S^{\mathrm{an}}$ one can define the Betti map from…
We study maximal subalgebras of an arbitrary finite dimensional algebra over a field, and obtain full classification/description results of such algebras. This is done by first obtaining a complete classification in the semisimple case, and…
We construct highly edge-connected $r$-regular graph which do not contain $r-2$ pairwise disjoint perfect matchings. The results partially answer a question stated by Thomassen [Factorizing regular graphs, J. Comb. Theory Ser. B (2019),…
By extending a construction due to Gross and McMullen [2], we show that for any odd integer n and for any even integer d>n+2 there are infinitely many Salem numbers $\alpha$ of degree d such that $\alpha^n-1$ is a unit. A similar result is…
Refining a constructive combinatorial method due to MacLane and Schilling, we give several criteria for a valued field that guarantee that all of its maximal immediate extensions have infinite transcendence degree. If the value group of the…
Given a marked surface (S,M) we can add arcs to the surface to create a triangulation, T, of that surface. For each triangulation, T, we can associate a cluster algebra. In this paper we will consider the torus of genus n with two interior…
The minimum number of observations such that the maximum likelihood estimator in a Gaussian graphical model exists with probability one is called the maximum likelihood threshold of the underlying graph G. The natural algebraic relaxation…
Let $\mathcal{A}_1,\ldots,\mathcal{A}_m$ be families of $k$-subsets of an $n$-set. Suppose that one cannot choose pairwise disjoint edges from $s+1$ distinct families. Subject to this condition we investigate the maximum of…
Rooted phylogenetic networks allow biologists to represent evolutionary relationships between present-day species by revealing ancestral speciation and hybridization events. A convenient and well-studied class of such networks are…
We introduce the notions of $\tau$-exceptional and signed $\tau$-exceptional sequences for any finite dimensional algebra. We prove that for a fixed algebra of rank $n$, and for any positive integer $t \leq n$, there is a bijection between…
Let $(G,\sigma)$ be any signed planar graph. We show that the Alon-Tarsi number of $(G,\sigma)$ is at most 5, generalizing a recent result of Zhu for unsigned case. In addition, if $(G,\sigma)$ is $2$-colorable then $(G,\sigma)$ has the…
This paper initiates the study of the classic balanced graph partitioning problem from an online perspective: Given an arbitrary sequence of pairwise communication requests between $n$ nodes, with patterns that may change over time, the…
Let $G$ be a simple graph with $n$ vertices and $m$ edges. According to Tur\'{a}n's theorem, if $G$ is $K_{r+1}$-free, then $m \leq |E(T(n, r))|,$ where $T(n, r)$ denotes the Tur\'{a}n graph on $n$ vertices with a maximum clique of order…
In this paper we classify filiform associative algebras of degree $k$ over a field of characteristic zero. Moreover, we also classify naturally graded complex filiform and quasi-filiform nilpotent associative algebras which are described by…
The family of right-angled tiling links consists of links built from regular 4-valent tilings of constant-curvature surfaces that contain one or two types of tiles. The complements of these links admit complete hyperbolic structures and…
We describe several graphs with arbitrarily large rankwidth (or equivalently with arbitrarily large cliquewidth). Korpelainen, Lozin, and Mayhill [Split permutation graphs, Graphs and Combinatorics, 30(3):633-646, 2014] proved that there…
We introduce the notion of a topological higher-rank graph, a unified generalization of the higher-rank graph and the topological graph. Using groupoid techniques, we define the Toeplitz and Cuntz-Krieger algebras of topological higher-rank…
The descriptions (up to isomorphism) of naturally graded $p$-filiform Leibniz algebras and $p$-filiform ($p\leq 3$) Leibniz algebras of maximum length are known. In this paper we study the gradation of maximum length for $p$-filiform…
This is a sequel to the paper \cite{MO-mw} which identified maximally writhed algebraic links in $\rp^3$ and classified them topologically. In this paper we prove that all maximally writhed links of the same topological type are rigidly…