English
Related papers

Related papers: Strongly connected orientations and integer lattic…

200 papers

A sharp asymptotic formula for the number of strongly connected digraphs on $n$ labelled vertices with $m$ arcs, under a condition $m-n\to\infty$, $m=O(n)$, is obtained; this solves a problem posed by Wright back in $1977$. Our formula is a…

Combinatorics · Mathematics 2010-05-07 Boris Pittel

The aim of this paper is to establish a lattice theoretical framework to study the partially ordered set $\operatorname{\mathsf{tors}} A$ of torsion classes over a finite-dimensional algebra $A$. We show that $\operatorname{\mathsf{tors}}…

Representation Theory · Mathematics 2024-08-13 Laurent Demonet , Osamu Iyama , Nathan Reading , Idun Reiten , Hugh Thomas

Let $\mathcal{F}$ be a family of graphs, and let $p,r$ be nonnegative integers. The \textsc{$(p,r,\mathcal{F})$-Covering} problem asks whether for a graph $G$ and an integer $k$, there exists a set $D$ of at most $k$ vertices in $G$ such…

Data Structures and Algorithms · Computer Science 2022-07-15 Jungho Ahn , Jinha Kim , O-joung Kwon

Dilaton effective field theory (dEFT) can be employed to analyze lattice data in gauge theories that lie in close proximity of the lower edge of the conformal window. Under special conditions, we show that it can be used as a diagnostic…

High Energy Physics - Lattice · Physics 2026-02-09 Thomas Appelquist , James Ingoldby , Maurizio Piai

Disjointness, bands, and band projections are a classical and essential part of the structure theory of vector lattices. If $X$ is such a lattice, those notions seem - at first glance - intimately related to the lattice operations on $X$.…

Functional Analysis · Mathematics 2020-12-25 Jochen Glück

Let $G$ and $H$ be simple 3-connected graphs such that $G$ has an $H$-minor. An edge $e$ in $G$ is called {\it $H$-deletable} if $G\backslash e$ is 3-connected and has an $H$-minor. The main result in this paper establishes that, if $G$ has…

Combinatorics · Mathematics 2023-07-12 S. R. Kingan

Let $f:\mathbb{C}^2\to\mathbb{C}$ be an inner non-degenerate mixed polynomial with a nice Newton boundary with $N$ compact 1-faces. In the first part of this series of papers we showed that $f$ has a weakly isolated singularity and that its…

Geometric Topology · Mathematics 2023-10-19 Benjamin Bode

We show that for those lattices of Voronoi's first kind with known obtuse superbasis, a closest lattice point can be computed in $O(n^4)$ operations where $n$ is the dimension of the lattice. To achieve this a series of relevant lattice…

Information Theory · Computer Science 2014-05-28 Robby G. McKilliam , Alex Grant , I. Vaughan L. Clarkson

Let $\Delta=\Delta_1\times\ldots\times \Delta_d\subseteq\mathbb{R}^n$, where $\mathbb{R}^n=\mathbb{R}^{n_1}\times\cdots\times\mathbb{R}^{n_d}$ with each $\Delta_i\subseteq\mathbb{R}^{n_i}$ a non-degenerate simplex of $n_i$ points. We prove…

Combinatorics · Mathematics 2023-01-27 Neil Lyall , Akos Magyar

Let I be a dense linear order with a left endpoint but no right endpoint. We consider the lattice L(I) of finite unions of closed intervals of I. This lattice arises naturally in the setting of o-minimality, as these are precisely the…

Logic · Mathematics 2022-07-19 Deacon Linkhorn

Let alpha = (a,b,...) be a composition. Consider the associated poset F(alpha), called a fence, whose covering relations are x_1 < x_2 < ... < x_{a+1} > x_{a+2} > ... > x_{a+b+1} < x_{a+b+2} < ... . We study the associated distributive…

Combinatorics · Mathematics 2020-09-01 Thomas McConville , Bruce E. Sagan , Clifford Smyth

Let $G$ be a graph, $S \subseteq V(G)$ be a vertex set in $G$ and $r$ be a positive integer. The distance $r$-independence number of $S$ is the size of the largest subset $I \subseteq S$ such that no pair $u$, $v$ of vertices in $I$ have a…

Combinatorics · Mathematics 2026-05-07 Maria Chudnovsky , Julien Codsi , Ajaykrishnan E S , Daniel Lokshtanov

We present a strengthening of the countable Menger theorem (edge version) of R. Aharoni. Let $ D=(V,A) $ be a countable digraph with $ s\neq t\in V $ and let $\mathcal{M}=\bigoplus_{v\in V}\mathcal{M}_v $ be a matroid on $ A $ where $…

Combinatorics · Mathematics 2017-05-02 Attila Joó

Let P be a convex polytope containing the origin, whose dual is a lattice polytope. Hibi's Palindromic Theorem tells us that if P is also a lattice polytope then the Ehrhart $\delta$-vector of P is palindromic. Perhaps less well-known is…

Combinatorics · Mathematics 2022-10-28 Matthew H. J. Fiset , Alexander M. Kasprzyk

Let $X$ be an Archimedean vector lattice. We investigate subalgebras of $\mathscr{L}(X)$ consisting of regular operators that contain all rank-one operators of the form $a \otimes \varphi_b$, where $a$ and $b$ are atoms of $X$ and…

Functional Analysis · Mathematics 2026-01-30 Gregor Cigler , Marko Kandić

Given integers $\Delta\ge 2$ and $t\ge 2\Delta$, suppose there is a graph of maximum degree $\Delta$ and a partition of its vertices into blocks of size at least $t$. By a seminal result of Haxell, there must be some independent set of the…

Combinatorics · Mathematics 2024-07-08 Pjotr Buys , Ross J. Kang , Kenta Ozeki

We prove that every point-determining digraph $D$ contains a vertex $v$ such that $D-v$ is also point determining. We apply this result to show that for any $\{0,1\}$-matrix $M$, with $k$ diagonal zeros and $\ell$ diagonal ones, the size of…

Combinatorics · Mathematics 2013-08-05 Pavol Hell , César Hernández-Cruz

We introduce a new class of partial actions of free groups on totally disconnected compact Hausdorff spaces, which we call convex subshifts. These serve as an abstract framework for the partial actions associated with finite separated…

Operator Algebras · Mathematics 2017-05-15 Pere Ara , Matias Lolk

There has been wide interest in understanding which properties of base graphs of matroids extend to base-cobase graphs of matroids. A significant result of Naddef and Pulleyblank (1984) shows that the $1$-skeleton of any $(0,1)$-polytope is…

Combinatorics · Mathematics 2025-06-30 Leonardo Martínez-Sandoval , Kolja Knauer

For a presentation $\mathcal{A}$ of a transversal matroid $M$, we study the set $T_{\mathcal{A}}$ of single-element transversal extensions of $M$ that have presentations that extend $\mathcal{A}$; we order these extensions by the weak…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin
‹ Prev 1 8 9 10 Next ›