English
Related papers

Related papers: Combinatorial Stokes formulas via minimal resoluti…

200 papers

In one of their seminal articles on allowable sequences, Goodman and Pollack gave combinatorial generalizations for three problems in discrete geometry, one of which being the Dirac conjecture. According to this conjecture, any set of $n$…

Combinatorics · Mathematics 2022-08-30 Adrian Dumitrescu

Let $G$ be a non-trivial finite group. The well-known Dold's theorem states that: There is no continuous $G$-equivariant map from an $n$-connected simplicial $G$-complex to a free simplicial $G$-complex of dimension at most $n$. In this…

Combinatorics · Mathematics 2019-01-23 Hamid Reza Daneshpajouh

We adapt methods coming from additive combinatorics in groups to the study of linear span in associative unital algebras. In particular, we establish for these algebras analogues of Diderrich-Kneser's and Hamidoune's theorems on sumsets and…

Combinatorics · Mathematics 2015-06-24 Vincent Beck , Cédric Lecouvey

In this note, we give short proofs of three theorems concerning extremal problems in the Johnson scheme, or, in other terminology, on $(n,k,L)$-systems. The main result is a proof of the Aljohani--Bamberg--Cameron conjecture which claims…

Combinatorics · Mathematics 2026-05-29 Danila Cherkashin , Yakov Shubin

This paper introduces modern geometric combinatorial technology from the theory of triangulations in order to derive results in toric symplectic geometry. In the main part of the paper we prove a number of properties of the space…

Symplectic Geometry · Mathematics 2025-10-28 Álvaro Pelayo , Francisco Santos

Packing graphs is a combinatorial problem where several given graphs are being mapped into a common host graph such that every edge is used at most once. In the planar tree packing problem we are given two trees T1 and T2 on n vertices and…

Computational Geometry · Computer Science 2016-03-28 Markus Geyer , Michael Hoffmann , Michael Kaufmann , Vincent Kusters , Csaba D. Tóth

In this work we show that given a connectivity graph $G$ of a $[[n,k,d]]$ quantum code, there exists $\{K_i\}_i, K_i \subset G$, such that $\sum_i |K_i|\in \Omega(k), \ |K_i| \in \Omega(d)$, and the $K_i$'s are $\tilde{\Omega}(…

Information Theory · Computer Science 2023-09-29 Nouédyn Baspin

We consider a "twisted" noncommutative join procedure for unital $C^*$-algebras which admit actions by a compact abelian group $G$ and its discrete abelian dual $\Gamma$, so that we may investigate an analogue of Baum-Dabrowski-Hajac…

Operator Algebras · Mathematics 2019-07-04 Benjamin Passer

We develop a family-based route to unicyclic graphs whose independence polynomials are unimodal but not log-concave. The paper is organized around one flagship statement: for the explicit KL-closure family $U_{k,r}$, with $r\in\{0,1,2\}$…

Combinatorics · Mathematics 2026-03-19 Vadim E. Levit , Ohr Kadrawi

We present a number of combinatorial characterizations of K-matrices. This extends a theorem of Fiedler and Ptak on linear-algebraic characterizations of K-matrices to the setting of oriented matroids. Our proof is elementary and simplifies…

Optimization and Control · Mathematics 2013-01-23 Jan Foniok , Komei Fukuda , Lorenz Klaus

Working in a polynomial ring $S=\mathbf{k}[x_1,\ldots,x_n]$ where $\mathbf{k}$ is an arbitrary commutative ring with $1$, we consider the $d^{th}$ Veronese subalgebras $R=S^{(d)}$, as well as natural $R$-submodules $M=S^{(\geq r, d)}$…

Commutative Algebra · Mathematics 2024-02-21 Ayah Almousa , Michael Perlman , Alexandra Pevzner , Victor Reiner , Keller VandeBogert

The generic ultrafilter $\mathcal{G}_2$ forced by $\mathcal{P}(\omega\times\omega)/($Fin$\otimes$Fin) was recently proved to be neither maximum nor minimum in the Tukey order of ultrafilters (in a recent paper of Blass, Dobrinen, and…

Logic · Mathematics 2014-06-06 Natasha Dobrinen

An equivariant Thom isomorphism theorem in operator K-theory is formulated and proven for infinite rank Euclidean vector bundles over finite dimensional Riemannian manifolds. The main ingredient in the argument is the construction of a…

K-Theory and Homology · Mathematics 2007-05-23 Jody Trout

In 1952, Dirac proved that every $2$-connected $n$-vertex graph with the minimum degree $k+1$ contains a cycle of length at least $\min\{n, 2(k+1)\}$. Here we obtain a stability version of this result by characterizing those graphs with…

Combinatorics · Mathematics 2022-08-04 Xiutao Zhu , Ervin Győri , Zhen He , Zequn Lv , Nika Salia , Chuanqi Xiao

We present a general abstract framework for combinatorial Dyson-Schwinger equations, in which combinatorial identities are lifted to explicit bijections of sets, and more generally equivalences of groupoids. Key features of combinatorial…

Mathematical Physics · Physics 2017-06-07 Joachim Kock

We use correspondences to define a purely topological equivariant bivariant K-theory for spaces with a proper groupoid action. Our notion of correspondence differs slightly from that of Connes and Skandalis. We replace smooth K-oriented…

K-Theory and Homology · Mathematics 2012-06-29 Heath Emerson , Ralf Meyer

The system of undetermined coefficients of a bifurcation problem G[z]=0 in Banach spaces is investigated for proving the existence of families of solution curves by use of the implicit function theorem. The main theorem represents an…

Algebraic Geometry · Mathematics 2019-07-23 Matthias Stiefenhofer

By introducing a notion of smooth connection for unbounded $KK$-cycles, we show that the Kasparov product of such cycles can be defined directly, by an algebraic formula. In order to achieve this it is necessary to develop a framework of…

K-Theory and Homology · Mathematics 2014-04-18 Bram Mesland

We quantify the topological expansion properties of bounded degree simplicial complexes in terms of a family of sublinear functions, in analogy with the separation profile of Benjamini-Schramm-Tim\'ar for classical expansion of bounded…

Metric Geometry · Mathematics 2024-11-21 David Hume

We introduce a new model for random simplicial complexes which with high probability generates a complex that has a simply-connected double cover. Hence we develop a model for random simplicial complexes with fundamental group…

Combinatorics · Mathematics 2022-10-21 Florian Frick , Andrew Newman