English
Related papers

Related papers: A note on connectivity preserving splitting operat…

200 papers

We propose the formulation of a dihadron fragmentation function in terms of parton matrix elements. Under the collinear factorization approximation and facilitated by the cut-vertex technique, the two hadron inclusive cross section at…

High Energy Physics - Phenomenology · Physics 2014-11-17 A. Majumder

The equations of motion of a single particle subject to an arbitrary electric and a static magnetic field form a Poisson system. We present a second-order time integration method which preserves well the Poisson structure and compare it to…

Numerical Analysis · Mathematics 2016-01-06 Christian Knapp , Alexander Kendl , Antti Koskela , Alexander Ostermann

Matroidal entropy functions are entropy functions in the form $\mathbf{h} = \log v \cdot \mathbf{r}_M$ , where $v \ge 2$ is an integer and $\mathbf{r}_M$ is the rank function of a matroid $M$. They can be applied into capacity…

Information Theory · Computer Science 2024-01-31 Qi Chen , Minquan Cheng , Baoming Bai

The description of electron current through a splitting is a mathematical problem of electron transport in quantum networks. For quantum networks constructed on the interface of narrow-gap semiconductors the relevant scattering problem for…

Mathematical Physics · Physics 2007-05-23 M. Harmer , A. Mikhailova , B. S. Pavlov

The splitting-off operation in undirected graphs is a fundamental reduction operation that detaches all edges incident to a given vertex and adds new edges between the neighbors of that vertex while preserving their degrees. Lov\'asz (1974)…

Data Structures and Algorithms · Computer Science 2024-02-19 Kristóf Bérczi , Karthekeyan Chandrasekaran , Tamás Király , Shubhang Kulkarni

In [27], we provided results on the $p$-modulus of the family of all bases of matroids and showed that it recovers various concepts in matroid theory, including strength, fractional arboricity, and principal partitions. In particular, the…

Combinatorics · Mathematics 2026-04-15 Huy Truong , Pietro Poggi-Corradini

For a matroid with an ordered (or "labelled") basis, a basis exchange step removes one element with label $l$ and replaces it by a new element that results in a new basis, and with the new element assigned label $l$. We prove that one…

Data Structures and Algorithms · Computer Science 2016-12-06 Anna Lubiw , Vinayak Pathak

This paper studies optimal matroid partitioning problems for various objective functions. In the problem, we are given a finite set $E$ and $k$ weighted matroids $(E, \mathcal{I}_i, w_i)$, $i = 1, \dots, k$, and our task is to find a…

Data Structures and Algorithms · Computer Science 2017-10-04 Yasushi Kawase , Kei Kimura , Kazuhisa Makino , Hanna Sumita

Homogeneous matroids are characterized by the property that strength equals fractional arboricity, and arise in the study of base modulus [22]. For graphic matroids, Cunningham [9] provided efficient algorithms for calculating graph…

Combinatorics · Mathematics 2024-08-02 Huy Truong , Pietro Poggi-Corradini

We introduce a new axiomatization of matroid theory that requires the elimination property only among modular pairs of circuits, and we present a cryptomorphic phrasing thereof in terms of Crapo's axioms for flats. This new point of view…

Combinatorics · Mathematics 2016-08-23 Emanuele Delucchi

A split of a polytope $P$ is a (regular) subdivision with exactly two maximal cells. It turns out that each weight function on the vertices of $P$ admits a unique decomposition as a linear combination of weight functions corresponding to…

Combinatorics · Mathematics 2008-07-02 Sven Herrmann , Michael Joswig

The active bijection for oriented matroids (and real hyperplane arrangements, and graphs, as particular cases) is introduced and investigated by the authors in a series of papers. Given any oriented matroid defined on a linearly ordered…

Combinatorics · Mathematics 2018-07-19 Emeric Gioan , Michel Las Vergnas

Let $M$ be a $3$-connected binary matroid; $M$ is called internally $4$-connected if one side of every $3$-separation is a triangle or a triad, and $M$ is $(4,4,S)$-connected if one side of every $3$-separation is a triangle, a triad, or a…

Combinatorics · Mathematics 2016-08-04 Carolyn Chun , James Oxley

We study arrangements of slightly skewed tropical hyperplanes, called blades by A. Ocneanu, on the vertices of a hypersimplex $\Delta_{k,n}$, and we investigate the resulting induced polytopal subdivisions. We show that placing a blade on a…

Combinatorics · Mathematics 2022-06-03 Nick Early

Brylawski and Seymour independently proved that if $M$ is a connected matroid with a connected minor $N$, and $e \in E(M) - E(N)$, then $M \backslash e$ or $M / e$ is connected having $N$ as a minor. This paper proves an analogous but…

Combinatorics · Mathematics 2019-08-28 Zachary Gershkoff , James Oxley

Within the context of FSSH dynamics, one often wishes to remove the angular component of the derivative coupling between states $\left|J\right>$ and $\left|K\right>$. In a set of previous papers, Truhlar {\em et al.} posited one approach…

Computational Physics · Physics 2024-01-26 Tian Qiu , Mansi Bhati , Zhen Tao , Xuezhi Bian , Jonathan Rawlinson , Robert G. Littlejohn , Joseph E. Subotnik

We study the effect of a splitting operator S_t on the L^p norm of the Fourier transform of a function f and on the operator norm of a Fourier multiplier m. Most of our results assume p is an even integer, and are often stronger when f or m…

Functional Analysis · Mathematics 2013-09-03 Laura De Carli , Steve Hudson

Using the coherent state formalism we calculate matrix elements of the one-loop non-planar dilatation operator of ${\cal N}=4$ SYM between operators dual to folded Frolov-Tseytlin strings and observe a curious scaling behavior. We comment…

High Energy Physics - Theory · Physics 2009-05-20 P. -Y. Casteill , R. A. Janik , A. Jarosz , C. Kristjansen

A partitioned matroid $(M, \{X_1,X_2,\dots,X_n\})$ consists of a matroid $M$ and a partition $\{X_1,X_2,\dots,X_n\}$ of its ground set. As such structures arise frequently in structural matroid theory, this paper introduces a general…

Combinatorics · Mathematics 2025-04-17 Nick Brettell , James Oxley , Charles Semple , Geoff Whittle

We propose a splitting algorithm for solving a system of composite monotone inclusions formulated in the form of the extended set of solutions in real Hilbert spaces. The resluting algorithm is a an extension of the algorithm in [4]. The…

Optimization and Control · Mathematics 2013-08-14 Dinh Dung , Bang Cong Vu