English
Related papers

Related papers: Column convex matrices, $G$-cyclic orders, and flo…

200 papers

Graph complements G(n) of cyclic graphs are circulant, vertex-transitive, claw-free, strongly regular, Hamiltonian graphs with a Z(n) symmetry, Shannon capacity 2 and known Wiener and Harary index. There is an explicit spectral zeta…

Combinatorics · Mathematics 2021-01-19 Oliver Knill

We introduce and study the Steiner entire function, an analytic generating function for the intrinsic volumes of a convex compact set in a Hilbert space. This function extends the classical Steiner polynomial to infinite dimensions and…

Metric Geometry · Mathematics 2025-07-17 Maria Dospolova , Mikhail Germanskov , Dmitry Zaporozhets

An unsplittable multiflow routes the demand of each commodity along a single path from its source to its sink node. As our main result, we prove that in series-parallel digraphs, any given multiflow can be expressed as a convex combination…

Combinatorics · Mathematics 2025-07-22 Mohammed Majthoub Almoghrabi , Martin Skutella , Philipp Warode

We present and analyze a finite volume scheme of arbitrary order for elliptic equations in the one-dimensional setting. In this scheme, the control volumes are constructed by using the Gauss points in subintervals of the underlying mesh. We…

Numerical Analysis · Mathematics 2012-07-04 Waixiang Cao , Zhimin Zhang , Qingsong Zou

We combine Gromov's amenable localization technique with the Poincar\'{e} duality to study the traversally generic vector flows on smooth compact manifolds $X$ with boundary. Such flows generate well-understood stratifications of $X$ by the…

Geometric Topology · Mathematics 2015-11-24 Gabriel Katz

Many questions at the core of graph theory can be formulated as questions about certain group-valued flows: examples are the cycle double cover conjecture, Berge-Fulkerson conjecture, and Tutte's 3-flow, 4-flow, and 5-flow conjectures. As…

Combinatorics · Mathematics 2013-05-30 Robert Šámal

This paper defines, for each convex polytope $\Delta$, a family $H_w\Delta$ of vector spaces. The definition uses a combination of linear algebra and combinatorics. When what is called exact calculation holds, the dimension $h_w\Delta$ of…

alg-geom · Mathematics 2007-05-23 Jonathan Fine

The scissors congruence conjecture for the unimodular group is an analogue of Hilbert's third problem, for the equidecomposability of polytopes. Liu and Osserman studied the Ehrhart quasi-polynomials of polytopes naturally associated to…

We bound the volume of thick embeddings of finite graphs into the Heisenberg group, as well as the volume of coarse wirings of finite graphs into groups with polynomial growth. This work follows the work of Kolmogorov-Brazdin, Gromov-Guth…

Metric Geometry · Mathematics 2024-10-29 Or Kalifa

Let $k$ be a positive integer and let $G$ be a graph with $n$ vertices. A connected $k$-subpartition of $G$ is a collection of $k$ pairwise disjoint sets (a.k.a. classes) of vertices in $G$ such that each set induces a connected subgraph.…

Combinatorics · Mathematics 2025-12-23 Phablo F. S. Moura , Hande Yaman , Roel Leus

Using the entropic inequalities for Shannon and Tsallis entropies new inequalities for some classical polynomials are obtained. To this end, an invertible mapping for the irreducible unitary representation of groups $SU(2)$ and $SU(1,1)$…

Quantum Physics · Physics 2015-11-24 V. I. Man'ko , L. A. Markovich

Let $\mathbb{K}$ be a field and $S=\mathbb{K}[x_1,\dots,x_n]$ be the polynomial ring in $n$ variables over $\mathbb{K}$. Let $G$ be a graph with $n$ vertices. Assume that $I=I(G)$ is the edge ideal of $G$ and $J=J(G)$ is its cover ideal. We…

Commutative Algebra · Mathematics 2016-04-05 S. A. Seyed Fakhari

We consider classical curvature flows: 1-parameter families of convex embeddings of the 2-sphere into Euclidean 3-space which evolve by an arbitrary (non-homogeneous) function of the radii of curvature. The associated flow of the radii of…

Differential Geometry · Mathematics 2020-07-14 Brendan Guilfoyle , Wilhelm Klingenberg

In the present paper we show a dichotomy theorem for the complexity of polynomial evaluation. We associate to each graph H a polynomial that encodes all graphs of a fixed size homomorphic to H. We show that this family is computable by…

Computational Complexity · Computer Science 2012-10-30 Nicolas de Rugy-Altherre

We revisit entropy methods to prove new sharp trace logarithmic Sobolev and sharp Gagliardo-Nirenberg-Sobolev inequalities on the half space, with a focus on the entropy inequality itself and not the actual flow, allowing for somewhat…

Analysis of PDEs · Mathematics 2021-12-28 Simon Zugmeyer

For every finite simple connected graph $G = (V,E)$, we introduce an invariant, its blowup-polynomial $p_G(\{ n_v : v \in V \})$. This is obtained by dividing the determinant of the distance matrix of its blowup graph $G[{\bf n}]$…

Combinatorics · Mathematics 2023-01-03 Projesh Nath Choudhury , Apoorva Khare

In this paper, we introduce the concept of $k$-integral graphs. A graph $\Gamma$ is called $k$-integral if the extension degree of the splitting field of the characteristic polynomial of $\Gamma$ over rational field $\mathbb Q$ is equal to…

Combinatorics · Mathematics 2025-08-06 Alireza Abdollahi , Majid Arezoomand , Tao Feng , Shixin Wang

In this paper, we present a method based on contour integration to investigate a class of cyclotomic parametric Ap\'ery-like series. The general term of such series involves a parametric central binomial coefficient, which is defined via…

Number Theory · Mathematics 2026-02-25 Ce Xu

In this paper it is proved that near a compact, invariant, proper subset of a continuous flow on a compact, connected metric space, at least one, out of twenty eight relevant dynamical phenomena, will necessarily occur. This result shows…

Dynamical Systems · Mathematics 2012-02-14 Pedro Teixeira

We study the Hopf monoid of convex geometries, which contains partial orders as a Hopf submonoid, and investigate the combinatorial invariants arising from canonical characters. Each invariant consists of a pair: a polynomial and a more…

Combinatorics · Mathematics 2025-06-30 Yichen Ma