English
Related papers

Related papers: Reductions Between Cardinal Characteristics of the…

200 papers

The continuum has been one of the most controversial topics in mathematics since the time of the Greeks. Some mathematicians, such as Euclid and Cantor, held the position that a line is composed of points, while others, like Aristotle, Weyl…

History and Overview · Mathematics 2025-08-13 Mohammad Ardeshir , Rasoul Ramezanian

We present intersection type systems in the style of sequent calculus, modifying the systems that Valentini introduced to prove normalisation properties without using the reducibility method. Our systems are more natural than Valentini's…

Logic in Computer Science · Computer Science 2015-03-18 Kentaro Kikuchi

This is the report-version of a mini-series of two articles on the foundations of satisfiability of conjunctive normal forms with non-boolean variables, to appear in Fundamenta Informaticae, 2011. These two parts are here bundled in one…

Discrete Mathematics · Computer Science 2012-02-15 Oliver Kullmann

Canonical duality-triality is a breakthrough methodological theory, which can be used not only for modeling complex systems within a unified framework, but also for solving a wide class of challenging problems from real-world applications.…

Mathematical Physics · Physics 2014-11-27 David Y Gao , Ning Ruan , Vittorio Latorre

Chv\'{a}tal's conjecture in extremal combinatorics asserts that for any decreasing family $\mathcal{F}$ of subsets of a finite set $S$, there is a largest intersecting subfamily of $\mathcal{F}$ consisting of all members of $\mathcal{F}$…

Combinatorics · Mathematics 2016-09-01 Ehud Friedgut , Jeff Kahn , Gil Kalai , Nathan Keller

Characterization of real-world complex systems increasingly involves the study of their topological structure using graph theory. Among global network properties, small-world property, consisting in existence of relatively short paths…

Social and Information Networks · Computer Science 2017-02-28 Jaroslav Hlinka , David Hartman , Milan Paluš

We revisit Royen's proof of the Gaussian correlation inequality from a supersymmetric point of view. Many key elements in Royen's proof of this inequality have natural geometric interpretations in terms of supersymmetric dimensional…

Probability · Mathematics 2026-05-04 Yichao Huang

We consider the Boolean model on $\R^d$. We prove some equivalences between subcritical percolation properties. Let us introduce some notations to state one of these equivalences. Let $C$ denote the connected component of the origin in the…

Probability · Mathematics 2018-03-05 Jean-Baptiste Gouéré , Marie Théret

The key element of the approach to the theory of necessary conditions in optimal control discussed in the paper is reduction of the original constrained problem to unconstrained minimization with subsequent application of a suitable…

Optimization and Control · Mathematics 2019-06-26 A. D. Ioffe

The existence of extremal functions for the Sobolev trace inequalities is studied using the concentration compactness theorem. The conjectured extremal, the function of conformal factor, is considered and is proved to be an actual extremal…

Classical Analysis and ODEs · Mathematics 2007-05-23 Young Ja Park

The article provides a modest survey of the absolute theory of general systems of (partial) differential equations. The equations are relieved of all additional structures and subject to quite arbitrary change of the variables. An abstract…

Differential Geometry · Mathematics 2015-04-02 Veronika Chrastinova , Vaclav Tryhuk

We present an extension of the classical theory of calculus of variations to generalized functions. The framework is the category of generalized smooth functions, which includes Schwartz distributions while sharing many nonlinear properties…

Functional Analysis · Mathematics 2016-08-11 Alexander Lecke , Lorenzo Luperi Baglini , Paolo Giordano

For bipartite graphs the NP-completeness is proved for the problem of existence of maximum matching which removal leads to a graph with given lower(upper)bound for the cardinality of its maximum matching.

Discrete Mathematics · Computer Science 2008-03-08 R. R. Kamalian , V. V. Mkrtchyan

We present a method to control gonality of nonarchimedean curves based on graph theory. Let k denote a complete nonarchimedean valued field. We first prove a lower bound for the gonality of a curve over the algebraic closure of k in terms…

Algebraic Geometry · Mathematics 2013-12-12 Gunther Cornelissen , Fumiharu Kato , Janne Kool

We generalize a famous tail Doob's inequality, relative two non-negative random variables, arising in the martingale theory, in two directions: on the more general source data and on the random variables belonging to the so-called Grand…

Probability · Mathematics 2022-06-03 M. R. Formica , E. Ostrovsky , L. Sirota

This paper develops a rich theory of cardinality in the paraconsistent and paracomplete set theory $\mathrm{BZFC}$, where sets can be inconsistent ($A$ such that ``$x\in A$'' is both true and false for some $x$) or incomplete ($A$ such that…

Logic · Mathematics 2026-04-09 Hrafn Valtýr Oddsson

Most comparisons of preferences are instances of single-crossing dominance. We examine the lattice structure of single-crossing dominance, proving characterisation, existence and uniqueness results for minimum upper bounds of arbitrary sets…

Theoretical Economics · Economics 2025-12-16 Gregorio Curello , Ludvig Sinander

We work in the setting of Zermelo-Fraenkel set theory without assuming the Axiom of Choice. We consider sets with the Boolean operations together with the additional structure of comparing cardinality (in the Cantorian sense of injections).…

Logic · Mathematics 2025-01-16 Matthew Harrison-Trainor , Dhruv Kulshreshtha

Recently a notion of self-duality for differential equations of maximal cuts was introduced, which states that there should be a basis in which the matrix for an {\epsilon}-factorised differential equation is persymmetric. It was observed…

High Energy Physics - Theory · Physics 2025-10-20 Claude Duhr , Franziska Porkert , Cathrin Semper , Sven F. Stawinski

This is a note on three graph parameters motivated by the Euler-Poincare characteristic for simplicial complex. We show those three graph parameters of a given connected graph $G$ is greater than or equal to that of the complete graph with…

Combinatorics · Mathematics 2012-11-28 Hanbaek Lyu