English
Related papers

Related papers: VC-dimensions Between Partially Ordered Sets and T…

200 papers

We introduce the batched set cover problem, which is a generalization of the online set cover problem. In this problem, the elements of the ground set that need to be covered arrive in batches. Our main technical contribution is a tight…

Data Structures and Algorithms · Computer Science 2018-11-28 Juan C. Martínez Mori , Samitha Samaranayake

Well-graded families, extremal systems and maximum systems (the last two in the sense of VC-theory and Sauer-Shelah lemma on VC-dimension) are three important classes of set systems. This paper aims to study the notion of duality in the…

Combinatorics · Mathematics 2022-12-19 Alireza Mofidi

Let $\mathbb{F}$ be a field. Denote by $t_n(\mathbb{F})$ the greatest possible dimension for a vector space of $n$-by-$n$ matrices over $\mathbb{F}$ in which every element is triangularizable over $\mathbb{F}$. It was recently proved that…

Rings and Algebras · Mathematics 2025-09-05 Clément de Seguins Pazzis

Partial orders are used extensively for modeling and analyzing concurrent computations. In this paper, we define two properties of partially ordered sets: width-extensibility and interleaving-consistency, and show that a partial order can…

Distributed, Parallel, and Cluster Computing · Computer Science 2014-10-07 Himanshu Chauhan , Vijay K. Garg

We characterize the downsets of integer partitions (ordered by containment of Ferrers diagrams) and compositions (ordered by the generalized subword order) which have finite dimension in the sense of Dushnik and Miller. In the case of…

Combinatorics · Mathematics 2017-03-22 Michael Engen , Vincent Vatter

The Vapnik-Chervonenkis (VC) dimension of a collection of subsets of a set is an important combinatorial concept in settings such as discrete geometry and machine learning. In this paper we prove that the VC dimension of the family of…

Combinatorics · Mathematics 2017-11-28 Christian J. J. Despres

Given an ordered partition $\Pi =\{P_1,P_2, ...,P_t\}$ of the vertex set $V$ of a connected graph $G=(V,E)$, the \emph{partition representation} of a vertex $v\in V$ with respect to the partition $\Pi$ is the vector…

Combinatorics · Mathematics 2014-02-10 Juan A. Rodriguez-Velazquez , Ismael G. Yero , Magdalena Lemanska

A set of vertices $W$ resolves a graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $W$. A metric dimension of $G$ is the minimum cardinality of a resolving set of $G$. A bipartite graph G(n,n) is…

Combinatorics · Mathematics 2015-03-17 S. W. Saputro , E. T. Baskoro , A. N. M. Salman , D. Suprijanto , And M. Baca

The geometric dimension $g$ of a Vector Addition System with States (VASS) is the dimension of the vector space generated by cycles in the VASS; this parameter refines the standard dimension $d$, the number of counters. Recently, it was…

Formal Languages and Automata Theory · Computer Science 2026-02-18 Wojciech Czerwiński , Roland Guttenberg , Łukasz Orlikowski , Henry Sinclair-Banks , Yangluo Zheng

A family $\mbox{$\cal F$}=\{F_1,\ldots,F_m\}$ of subsets of $[n]$ is said to be ordered, if there exists an $1\leq r\leq m$ index such that $n\in F_i$ for each $1\leq i\leq r$, $n\notin F_i$ for each $i>r$ and $|F_i|\leq |F_j|$ for each…

Combinatorics · Mathematics 2024-11-08 Gábor Hegedüs

The metric dimension of a graph is the minimum size of a set of vertices such that each vertex is uniquely determined by the distances to the vertices of that set. Our aim is to upper-bound the order $n$ of a graph in terms of its diameter…

Let $G$ be a graph and $S\subseteq V(G)$. If every two adjacent vertices of $G$ have different metric $S$-representations, then $S$ is a local metric generator for $G$. A local metric generator of smallest order is a local metric basis for…

Combinatorics · Mathematics 2019-02-26 Sandi Klavžar , Mostafa Tavakoli

Let V be a normal affine variety over the real numbers R, and let S be a semi-algebraic subset of V(R). We study the subring B(S) of the coordinate ring of V consisting of the polynomials that are bounded on S. We introduce the notion of…

Algebraic Geometry · Mathematics 2010-07-30 Daniel Plaumann , Claus Scheiderer

We construct a sequence of rank 3 distributions on $n$-dimensional manifolds for any $n\geq 7$ such that the dimension of their symmetry group grows exponentially in $n$ (more precisely it is equal to $\operatorname{Fib}_{n-1}+n+2$, where…

Differential Geometry · Mathematics 2020-04-16 Boris Doubrov , Igor Zelenko

We compare the dimension of a non-invertible self-affine set to the dimension of the respective invertible self-affine set. In particular, for generic planar self-affine sets, we show that the dimensions coincide when they are large and…

Dynamical Systems · Mathematics 2024-11-27 Antti Käenmäki , Petteri Nissinen

The maximal dimension of commutative subspaces of $M_n(\mathbb{C})$ is known. So is the structure of such a subspace when the maximal dimension is achieved. We consider extensions of these results and ask the following natural questions: If…

Rings and Algebras · Mathematics 2023-08-07 Matjaž Omladič , Heydar Radjavi , Klemen Šivic

A generalization of exterior calculus is considered by allowing the partial derivatives in the exterior derivative to assume fractional orders. That is, a fractional exterior derivative is defined. This is found to generate new vector…

Mathematical Physics · Physics 2009-11-10 Kathleen Cotrill-Shepherd , Mark Naber

The standard definition of the dimension of a vector space or rank of a module states that dimension or rank is equal to the cardinality of any basis, which requires an understanding of the concepts of basis, generating set, and linear…

Rings and Algebras · Mathematics 2023-07-18 Julia Maddox

Given a countable transitive model of set theory and a partial order contained in it, there is a natural countable Borel equivalence relation on generic filters over the model; two are equivalent if they yield the same generic extension. We…

Logic · Mathematics 2024-07-22 Iian B. Smythe

We study completeness of a topological vector space with respect to different filters on the set N of all naturals. In the metrizable case all these kinds of completeness are the same, but in non-metrizable case the situation changes. For…

Functional Analysis · Mathematics 2021-06-30 Vladimir Kadets , Dmytro Seliutin