English
Related papers

Related papers: On 2-partitionable clutters and the MFMC property

200 papers

We review some important results by Gross, Hacking, Keel, and Kontsevich on cluster algebra theory, namely, the column sign-coherence of $C$-matrices and the Laurent positivity, both of which were conjectured by Fomin and Zelevinsky. We…

Combinatorics · Mathematics 2023-02-23 Tomoki Nakanishi

The geometrical features of the (non-convex) loss landscape of neural network models are crucial in ensuring successful optimization and, most importantly, the capability to generalize well. While minimizers' flatness consistently…

Disordered Systems and Neural Networks · Physics 2020-07-28 Carlo Baldassi , Riccardo Della Vecchia , Carlo Lucibello , Riccardo Zecchina

In his 1984 AMS Memoir, George Andrews defined the family of $k$--colored generalized Frobenius partition functions. These are denoted by $c\phi_k(n)$ where $k\geq 1$ is the number of colors in question. In that Memoir, Andrews proved…

Number Theory · Mathematics 2014-05-15 Frank G. Garvan , James A. Sellers

Conjunctive normal forms where every clause has length at most two are called 2-CNFs. We study minimally unsatisfiable 2-CNFs (2-MUs), that is, unsatisfiable 2-CNFs where removing any clause destroys unsatisfiability, and obtain their full…

Discrete Mathematics · Computer Science 2026-04-24 Hoda Abbasizanjani , Oliver Kullmann

The Union-Closed Sets Conjecture asks whether every union-closed set family $\mathcal{F}$ has an element contained in half of its sets. In 2022, Nagel posed a generalisation of this problem, suggesting that the $k$th-most popular element in…

Combinatorics · Mathematics 2025-07-15 Shagnik Das , Saintan Wu

We consider countable linear orders and study the quasi-order of convex embeddability and its induced equivalence relation. We obtain both combinatorial and descriptive set-theoretic results, and further extend our research to the case of…

Logic · Mathematics 2025-05-06 Martina Iannella , Alberto Marcone , Luca Motto Ros , Vadim Weinstein

In this paper, we provide a complete description of the minimal primes of ideals generated by adjacent $2$-minors, in terms of the so-called admissible sets and associated lattice ideals. We prove that for these ideals, the properties of…

Commutative Algebra · Mathematics 2025-12-29 Takayuki Hibi , Francesco Navarra , Ayesha Asloob Qureshi , Sara Saeedi Madani

Between 1994 and 1998, the work of M. Brou\'e, G. Malle, and R. Rouquier generalized in a natural way the definition of the Hecke algebra associated to a finite Coxeter group, for the case of an arbitrary complex reflection group.…

Representation Theory · Mathematics 2016-08-03 Eirini Chavli

G. Edelman, O. Sporns, and G. Tononi have introduced the neural complexity of a family of random variables, defining it as a specific average of mutual information over subfamilies. We show that their choice of weights satisfies two natural…

Probability · Mathematics 2009-12-21 Jerome Buzzi , Lorenzo Zambotti

Chordal clutters in the sense of [14] and [3] are defined via simplicial orders. Their circuit ideal has a linear resolution, independent of the characteristic of the base field. We show that any Betti sequence of an ideal with linear…

Commutative Algebra · Mathematics 2016-02-09 Mina Bigdeli , Jürgen Herzog , Ali Akbar Yazdan Pour , Rashid Zaare-Nahandi

We define and study a continuous version of 2-frieze patterns, a combinatorial structure closely related with frieze patterns of Coxeter and Conway. We describe the relation of continuous 2-friezes with the moduli space of projective curves…

Combinatorics · Mathematics 2026-03-23 Serge Tabachnikov

Let F be a finite union-closed family of sets whose largest set contains n elements. In \cite{Wojcik92}, Wojcik defined the density of F to be the ratio of the average set size of F to n and conjectured that the minimum density over all…

Combinatorics · Mathematics 2011-06-03 Igor Balla

In a very recent work, G. E. Andrews defined the combinatorial objects which he called {\it singular overpartitions} with the goal of presenting a general theorem for overpartitions which is analogous to theorems of Rogers--Ramanujan type…

Number Theory · Mathematics 2024-05-31 Shi-Chao Chen , Michael D. Hirschhorn , James A. Sellers

We consider diffeomorphisms in the $C^\infty$-closure of the conjugancy class of translations of the 2-torus. By a theorem of Fathi and Herman, a generic diffeomorphism in that space is minimal and uniquely ergodic. We define a new…

Dynamical Systems · Mathematics 2010-11-23 Alejandro Kocsard , Andres Koropecki

The Frankl or Union-Closed Sets conjecture states that for any finite union-closed family of sets $\mathcal{F}$ containing some nonempty set, there is some element $i$ in the ground set $U(\mathcal F) := \bigcup_{S \in \mathcal{F}} S$ of…

Combinatorics · Mathematics 2024-10-16 Jonad Pulaj , Kenan Wood

We consider functions of natural numbers which allow a combinatorial interpretation as density functions (speed) of classes of relational structures, s uch as Fibonacci numbers, Bell numbers, Catalan numbers and the like. Many of these…

Combinatorics · Mathematics 2013-09-10 T. Kotek , J. A. Makowsky

The arithmetic properties of the ordinary partition function $p(n)$ have been the topic of intensive study for the past century. Ramanujan proved that there are linear congruences of the form $p(\ell n+\beta)\equiv 0\pmod\ell$ for the…

Number Theory · Mathematics 2022-12-06 Scott Ahlgren , Olivia Beckwith , Martin Raum

We carry out a detailed investigation of congruence half-factorial Krull monoids with finite cyclic class group and related problems. Specifically, we determine precisely all relatively large values that can occur as a minimal distance of a…

Number Theory · Mathematics 2017-09-05 A Plagne , Wolfgang Schmid

In this paper, we develop a theory of new classes of discrete convex functions, called L-extendable functions and alternating L-convex functions, defined on the product of trees. We establish basic properties for optimization: a…

Optimization and Control · Mathematics 2016-01-19 Hiroshi Hirai

For which sets A does there exist a mapping, computed by a total or partial recursive function, such that the mapping, when its domain is restricted to A, is a 1-to-1, onto mapping to $\Sigma^*$? And for which sets A does there exist such a…

Logic in Computer Science · Computer Science 2017-12-05 Lane A. Hemaspaandra , Daniel Rubery
‹ Prev 1 4 5 6 7 8 10 Next ›