English
Related papers

Related papers: A note on connectivity preserving splitting operat…

200 papers

We study Dressians of matroids using the initial matroids of Dress and Wenzel. These correspond to cells in regular matroid subdivisions of matroid polytopes. An efficient algorithm for computing Dressians is presented, and its…

Combinatorics · Mathematics 2020-08-05 Madeline Brandt , David E Speyer

We study the combinatorial properties of a tropical hyperplane arrangement. We define tropical oriented matroids, and prove that they share many of the properties of ordinary oriented matroids. We show that a tropical oriented matroid…

Combinatorics · Mathematics 2007-06-25 Federico Ardila , Mike Develin

Given a finite poset $P$, we associate a simple graph denoted by $G_P$ with all connected order ideals of $P$ as vertices, and two vertices are adjacent if and only if they have nonempty intersection and are incomparable with respect to set…

Combinatorics · Mathematics 2018-02-27 Ben P. Zhou

Vf-safe delta-matroids have the desirable property of behaving well under certain duality operations. Several important classes of delta-matroids are known to be vf-safe, including the class of ribbon-graphic delta-matroids, which is…

Combinatorics · Mathematics 2024-08-07 Joseph E Bonin , Carolyn Chun , Steven D Noble

Let $M$ be a matroid defined on a finite set $E$ and $L\subset E$. $L$ is locked in $M$ if $M|L$ and $M^*|(E\backslash L)$ are 2-connected, and $min\{r(L), r^*(E\backslash L)\} \geq 2$. Locked subsets characterize nontrivial facets of the…

Computational Complexity · Computer Science 2019-06-20 Brahim Chaourar

The Topological Representation Theorem for (oriented) matroids states that every (oriented) matroid can be realized as the intersection lattice of an arrangement of codimension one homotopy spheres on a homotopy sphere. In this paper, we…

Combinatorics · Mathematics 2015-03-19 Matthew T. Stamps

We introduce and study filtrations of a matroid on a linearly ordered ground set, which are particular sequences of nested sets. A given basis can be decomposed into a uniquely defined sequence of bases of minors, such that these bases have…

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

In the interaction of two electric quadrupoles, there is at short distances a contact term proportional to the second derivative of a delta function. This contact term contributes to the hyperfine splitting of bound states of two particles…

High Energy Physics - Phenomenology · Physics 2014-11-18 G. Karl , V. A. Novikov

In this paper, we propose a new type of matroids, namely covering matroids, and investigate the connections with the second type of covering-based rough sets and some existing special matroids. Firstly, as an extension of partitions,…

Artificial Intelligence · Computer Science 2012-12-03 Yanfang Liu , William Zhu

An equation containing a fractional power of an elliptic operator of second order is studied for Dirichlet boundary conditions. Finite difference approximations in space are employed. The proposed numerical algorithm is based on solving an…

Numerical Analysis · Computer Science 2015-05-18 Petr N. Vabishchevich

It is common in classical mechanics to encounter systems whose Hamiltonian $H$ is the sum of an often exactly integrable Hamiltonian $H_0$ and a small perturbation $\epsilon H_1$ with $\epsilon\ll1$. Such near-integrability can be exploited…

Earth and Planetary Astrophysics · Physics 2020-02-05 Hanno Rein

We study port-Hamiltonian systems on a familiy of intervals and characterise all boundary conditions leading to $m$-accretive realisations of the port-Hamiltonian operator and thus to generators of contractive semigroups. The proofs are…

Functional Analysis · Mathematics 2021-06-22 Rainer Picard , Sascha Trostorff , Bruce Watson , Marcus Waurick

Splitting methods have emerged as powerful tools to address complex problems by decomposing them into smaller solvable components. In this work, we develop a general approach to forward-backward splitting methods for solving monotone…

Optimization and Control · Mathematics 2026-04-20 Minh N. Dao , Matthew K. Tam , Thang D. Truong

In a large-momentum nucleon state, the matrix element of a gauge-invariant Euclidean Wilson line operator accessible from lattice QCD can be related to the standard light-cone parton distribution function through the large-momentum…

High Energy Physics - Phenomenology · Physics 2018-09-19 Taku Izubuchi , Xiangdong Ji , Luchang Jin , Iain W. Stewart , Yong Zhao

It follows by Bixby's Lemma that if $e$ is an element of a $3$-connected matroid $M$, then either ${\rm co}(M\delete e)$, the cosimplification of $M\delete e$, or ${\rm si}(M/e)$, the simplification of $M/e$, is $3$-connected. A natural…

Combinatorics · Mathematics 2021-11-24 George Drummond , Zachary Gershkoff , Susan Jowett , Charles Semple , Jagdeep Singh

We develop a discrete extension operator for trimmed spline spaces consisting of piecewise polynomial functions of degree $p$ with $k$ continuous derivatives. The construction is based on polynomial extension from neighboring elements…

Numerical Analysis · Mathematics 2022-11-01 Erik Burman , Peter Hansbo , Mats G. Larson , Karl Larsson

This article is a survey of matroid theory aimed at algebraic geometers. Matroids are combinatorial abstractions of linear subspaces and hyperplane arrangements. Not all matroids come from linear subspaces; those that do are said to be…

Algebraic Geometry · Mathematics 2014-09-12 Eric Katz

A beam splitter is a basic linear optical element appearing in many optics experiments and is frequently used as a continuous-variable entangler transforming a pair of input modes from a separable Gaussian state into an entangled state.…

We present Euler-type recurrence relations for some partition functions. Some of our results provide new recurrences for the number of unrestricted partitions of $n$, denote by $p(n)$. Others establish recurrences for partition functions…

Combinatorics · Mathematics 2020-07-16 Robson da Silva , Pedro Diniz Sakai

For a matroid of rank $r$ and a non-negative integer $k$, an element is called $k$-loose if every circuit containing it has size greater than $r-k$. Zaslavsky and the author characterized all binary matroids with a $1$-loose element. In…

Combinatorics · Mathematics 2025-03-17 Jagdeep Singh