English
Related papers

Related papers: Unavoidable subprojections in union-closed set sys…

200 papers

The problem of bounding the size of a set system under various intersection restrictions has a central place in extremal combinatorics. We investigate the maximum number of disjoint pairs a set system can have in this setting. In…

Combinatorics · Mathematics 2019-08-13 António Girão , Richard Snyder

Motivated by constructions from applied topology, there has been recent interest in the homological algebra of linear representations of posets, particularly in the context of homological algebra relative to non-standard exact structures. A…

Representation Theory · Mathematics 2025-07-18 Benjamin Blanchette , Justin Desrochers , Eric J. Hanson , Luis Scoccola

We continue the study of the structure of general subgroups (in particular maximal subgroups, also known as group $\mathcal{H}$-classes) of special inverse monoids. Recent research of the authors has established that these can be quite…

Group Theory · Mathematics 2025-07-02 Robert D. Gray , Mark Kambites

The convergence of the projection algorithm for solving the convex feasibility problem for a family of closed convex sets, is in connection with the regularity properties of the family. In the paper [18] are pointed out four cases of such a…

Numerical Analysis · Computer Science 2009-06-01 Laura Maruster , Stefan Maruster

A new ordering, extending the notion of universal cycles of Chung {\em et al.} (1992), is proposed for the blocks of $k$-uniform set systems. Existence of minimum coverings of pairs by triples that possess such an ordering is established…

Combinatorics · Mathematics 2010-08-11 Yeow Meng Chee , San Ling , Yin Tan , Xiande Zhang

We study cofinal systems of finite subsets of $\omega_1$. We show that while such systems can be NIP, they cannot be defined in an NIP structure. We deduce a positive answer to a question of Chernikov and Simon from 2013: in an NIP theory,…

Logic · Mathematics 2024-11-20 Martin Bays , Omer Ben-Neria , Itay Kaplan , Pierre Simon

This paper shows how maximum possible configuration efficiency of an indefinitely large software system is constrained by chosing a fixed upper limit to the number of program units per subsystem. It is then shown how the configuration…

Software Engineering · Computer Science 2008-11-18 Edmund Kirwan

We consider the problem of under and over-approximating the image of general vector-valued functions over bounded sets, and apply the proposed solution to the estimation of reachable sets of uncertain non-linear discrete-time dynamical…

Systems and Control · Electrical Eng. & Systems 2021-01-28 Eric Goubault , Sylvie Putot

An oriented link projection is the image of a generic immersion of oriented circles into the 2-sphere. The circle arrangement of a link projection is a disjoint union of unoriented circles on the 2-sphere obtained by orientation-incoherent…

Geometric Topology · Mathematics 2020-11-23 Noboru Ito , Shosaku Matsuzaki , Kouki Taniyama

We study how the supporting hyperplanes produced by the projection process can complement the method of alternating projections and its variants for the convex set intersection problem. For the problem of finding the closest point in the…

Optimization and Control · Mathematics 2014-02-11 C. H. Jeffrey Pang

Using the interpretation of the ultradiscretization procedure as a non-Archimedean valuation, we use results of tropical geometry to show how roots and poles manifest themselves in piece-wise linear systems as points of…

Mathematical Physics · Physics 2013-01-31 Christopher M. Ormerod

This paper establishes a formal framework, grounded in mathematical logic and order theory, to analyze the inherent limitations of radical transparency. We demonstrate that self-referential disclosure policies inevitably encounter…

Logic · Mathematics 2025-09-09 Faruk Alpay , Hamdi Alakkad

We study spherical completeness of ball spaces and its stability under expansions. We give some criteria for ball spaces that guarantee that spherical completeness is preserved when the ball space is closed under unions of chains. This…

Logic · Mathematics 2024-04-05 Wiesław Kubiś , Franz-Viktor Kuhlmann

For bilinear control systems in $\mathbb{R}^d$ we prove, under an accessibility hypothesis, the existence of a nontrivial compact set $D\subset\mathbb{R}^d$ satisfying $\mathcal{O}_t(D)=e^{tR}D$ for all $t>0$, where $R\in\mathbb{R}$ is a…

Optimization and Control · Mathematics 2024-09-18 Eduardo Celso Viscovini

We prove that there are arbitrarily large indecomposable ordered sets T with a 2-chain C such that the smallest indecomposable proper superset U of C in T is T itself. Subsequently, we characterize all such indecomposable ordered sets T and…

Combinatorics · Mathematics 2018-12-03 Bernd S. W. Schröder

Motivated by questions asked by Erdos, we prove that any set $A\subset{\mathbb N}$ with positive upper density contains, for any $k\in{\mathbb N}$, a sumset $B_1+\cdots+B_k$, where $B_1,\dots,B_k\subset{\mathbb N}$ are infinite. Our proof…

Dynamical Systems · Mathematics 2024-02-23 Bryna Kra , Joel Moreira , Florian K. Richter , Donald Robertson

We describe the order type of range sets of compact ultrametrics and show that an ultrametrizable infinite topological space $(X, \tau)$ is compact iff the range sets are order isomorphic for any two ultrametrics compatible with the…

General Topology · Mathematics 2021-03-01 Oleksiy Dovgoshey , Volodymir Shcherbak

Given a finite set, $X$, of points in projective space for which the Hilbert function is known, a standard result says that there exists a subset of this finite set whose Hilbert function is ``as big as possible'' inside $X$. Given a finite…

Algebraic Geometry · Mathematics 2007-05-23 Steven P. Diaz , Anthony V. Geramita , Juan C. Migliore

The Kochen-Specker theorem states that a 3-dimensional complex Euclidean space admits a finite configuration of projective lines such that the corresponding quantum observables (the orthogonal projectors) cannot be assigned with 0 and 1…

Quantum Physics · Physics 2015-05-13 Artur Ruuge

In the setting of CAT(k) spaces, common fixed point iterations built from prox mappings (e.g. prox-prox, Krasnoselsky-Mann relaxations, nonlinear projected-gradients) converge locally linearly under the assumption of linear metric…

Optimization and Control · Mathematics 2021-12-13 Florian Lauster , D. Russell Luke