English
Related papers

Related papers: Sticky matroids and convolution

200 papers

The introduction of covering-based rough sets has made a substantial contribution to the classical rough sets. However, many vital problems in rough sets, including attribution reduction, are NP-hard and therefore the algorithms for solving…

Artificial Intelligence · Computer Science 2013-11-06 Bin Yang , Hong Zhao , William Zhu

The category of all monads over many-sorted sets (and over other "set-like" categories) is proved to have coequalizers and strong cointersections. And a general diagram has a colimit whenever all the monads involved preserve monomorphisms…

Logic in Computer Science · Computer Science 2014-09-15 Jiří Adámek

We prove that the moduli stack of stable curves of genus g with n marked points is rigid, i.e., has no infinitesimal deformations. This confirms the first case of a principle proposed by Kapranov. It can also be viewed as a version of…

Algebraic Geometry · Mathematics 2010-03-16 Paul Hacking

The property of balance (in the sense of Feder and Mihail) is investigated in the context of paving matroids. The following examples are exhibited: (a) a class of ``sparse'' paving matroids that are balanced, but at the same time rich…

Combinatorics · Mathematics 2007-05-23 Mark Jerrum

Contraction theory is an analytical tool to study differential dynamics of a non-autonomous (i.e., time-varying) nonlinear system under a contraction metric defined with a uniformly positive definite matrix, the existence of which results…

Machine Learning · Computer Science 2026-03-18 Hiroyasu Tsukamoto , Soon-Jo Chung , Jean-Jacques E. Slotine

One of the least studied universal deformations of incompressible nonlinear elasticity, namely the straightening of a sector of a circular cylinder into a rectangular block, is revisited here and, in particular, issues of existence and…

Soft Condensed Matter · Physics 2020-09-22 Michel Destrade , Ray W. Ogden , Ivonne Sgura , Luigi Vergori

Finite smooth digraphs, that is, finite directed graphs without sources and sinks, can be partially ordered via pp-constructability. We give a complete description of this poset and, in particular, we prove that it is a distributive…

Rings and Algebras · Mathematics 2021-12-23 Manuel Bodirsky , Florian Starke , Albert Vucaj

We study the direct sum of q-matroids by way of their cyclic flats. Using that the rank function of a q-matroid is fully determined by the cyclic flats and their ranks, we show that the cyclic flats of the direct sum of two q-matroids are…

Combinatorics · Mathematics 2023-02-23 Heide Gluesing-Luerssen , Benjamin Jany

The formation of unstaggered localized modes in dynamical lattices can be supported by the interplay of discreteness and nonlinearity with a finite relaxation time. In rapidly responding nonlinear media, on-site discrete solitons are…

Pattern Formation and Solitons · Physics 2015-05-19 A. Maluckov , Lj. Hadzievski , B. A. Malomed

The main motivation here is a question: whether any polyhedron which can be subdivided into convex pieces without adding a vertex, and which has the same vertices as a convex polyhedron, is infinitesimally rigid. We prove that it is indeed…

Differential Geometry · Mathematics 2007-05-23 Robert Connelly , Jean-Marc Schlenker

We show how the Tutte polynomial of a matroid $M$ can be computed from its condensed configuration, which is a statistic of its lattice of cyclic flats. The results imply that the Tutte polynomial of $M$ is already determined by the…

Combinatorics · Mathematics 2014-09-26 Jens Niklas Eberhardt

Fix a matroid N. A matroid M is N-fragile if, for each element e of M, at least one of M\e and M/e has no N-minor. The Bounded Canopy Conjecture is that all GF(q)-representable matroids M that have an N-minor and are N-fragile have branch…

Combinatorics · Mathematics 2011-08-02 Dillon Mayhew , Geoff Whittle , Stefan H. M. van Zwam

A lattice L is slim if it is finite and the set of its join-irreducible elements contains no three-element antichain. Slim, semimodular lattices were previously characterized by G. Cz\'edli and E.T. Schmidt as the duals of the lattices…

Rings and Algebras · Mathematics 2012-08-31 Gábor Czédli , Tamás Dékány , László Ozsvárt , Nóra Szakács , Balázs Udvari

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

The authors conjectured previously that a knot is nonfibered if and only if its infinite cyclic cover has uncountably many finite covers. We prove the conjecture for a class of knots that includes all knots of genus 1, using techniques from…

Geometric Topology · Mathematics 2007-07-26 Daniel S. Silver , Susan G. Williams

This paper concerns piecewise-smooth maps on $\mathbb{R}^d$ that are continuous but not differentiable on switching manifolds (where the functional form of the map changes). The stability of fixed points on switching manifolds is…

Dynamical Systems · Mathematics 2016-12-12 David J. W. Simpson

In a previous article it was shown that when a three-dimensional smooth convex body has rotational symmetry around a coordinate axis one can find better bounds for the lattice point discrepancy than what is known for more general convex…

Number Theory · Mathematics 2017-10-02 Fernando Chamizo , Carlos Pastor

In this paper we study the interplay between the operation of circuit-hyperplane relaxation and the Kazhdan--Lusztig theory of matroids. We obtain a family of polynomials, not depending on the matroids but only on their ranks, that relate…

Combinatorics · Mathematics 2022-11-21 Luis Ferroni , Lorenzo Vecchi

Given two finite matroids on the same ground set, a celebrated result of Edmonds says that the ground set can be partitioned into two disjoint subsets in a manner that there is a common independent set in both matroids whose intersection…

Combinatorics · Mathematics 2025-01-27 Irfan Alam

We construct a family of independent sets for finite, atomic, and graded lattices, extending the well-known cryptomorphism between geometric lattices and matroids. This construction leads to an embedding theorem into geometric lattices that…

Combinatorics · Mathematics 2026-01-08 Or Raz
‹ Prev 1 4 5 6 7 8 10 Next ›