English
Related papers

Related papers: Closures and generating sets related to combinatio…

200 papers

Let $M$ be a non-zero binary matrix with distinct rows where the rows are closed under certain logical operators. In this article, we investigate the existence of columns containing an equal or greater number of ones than zeros.…

Combinatorics · Mathematics 2023-09-12 Mohammad Javad Moghaddas Mehr

A closure operator on a set $X$ is a function $\operatorname{cl}: \wp(X) \to \wp(X)$ satisfying, for all $A, B \subseteq X$, the following properties: extensivity, $A \subseteq \operatorname{cl}(A)$; monotonicity, which states that if $A…

Combinatorics · Mathematics 2026-03-17 Paulo Magalhães Junior , Renan Maneli Mezabarba , Rodrigo Santos Monteiro

We study connections between closure operators on an algebra $(A,\Om)$ and congruences on the extended power algebra defined on the same algebra. We use these connections to give an alternative description of the lattice of all subvarieties…

Rings and Algebras · Mathematics 2015-08-18 Agata Pilitowska , Anna Zamojska-Dzienio

In this thesis, a detailed study shows that closed itemsets and minimal generators play a key role for concisely representing both frequent itemsets and association rules. These itemsets structure the search space into equivalence classes…

Databases · Computer Science 2019-11-05 Sadok Ben Yahia

In this paper we investigate the interplay between isolated suborders and closures. Isolated suborders are a special kind of suborders and can be used to diminish the number of elements of an ordered set by means of a quotient construction.…

Discrete Mathematics · Computer Science 2024-08-07 Roland Glück

We define a construction on operads which yields a new description of the minimal model. The construction also allows us to define algebraic structures on the homology of chain complexes with homologously trivial operad algebra structures,…

Algebraic Topology · Mathematics 2015-08-17 Cole Hugelmeyer

Existence theorem is proven for the generating equations of the split involution constraint algebra. The structure of the general solution is established, and the characteristic arbitrariness in generating functions is described.

High Energy Physics - Theory · Physics 2009-10-31 I. A. Batalin , S. L. Lyakhovich , I. V. Tyutin

In this article, we give a theorem of reduction of the structure group of a principal bundle P with regular structure group G. Then, when G is in the classes of Lie groups defined by T.Robart [13], we define the closed holonomy group of a…

Differential Geometry · Mathematics 2007-05-23 Jean-Pierre Magnot

A solution is proposed for the problem of composition of ordinary generating functions. A new class of functions that provides a composition of ordinary generating functions is introduced; main theorems are presented; compositae are written…

Combinatorics · Mathematics 2010-09-15 Kruchinin Vladimir Victorovich

The $sl(2)$ minimal theories are labelled by a Lie algebra pair $(A,G)$ where $G$ is of $A$-$D$-$E$ type. For these theories on a cylinder we conjecture a complete set of conformal boundary conditions labelled by the nodes of the tensor…

High Energy Physics - Theory · Physics 2009-10-31 Roger E. Behrend , Paul A. Pearce , Jean-Bernard Zuber

We consider sets of operations on a set A that are closed under permutation of variables, addition of dummy variables and composition. We describe these closed sets in terms of a Galois connection between operations and systems of pointed…

Rings and Algebras · Mathematics 2016-11-22 Miguel Couceiro , Erkko Lehtonen

We provide a simple proof for the union-closed sets conjecture, a long-standing open problem in set theory with immediate applications to graph theory, number theory, and order-theory.

Combinatorics · Mathematics 2016-07-08 Sven Schäge

We give a full description of all sets of functions on the group $(\mathbb{ Z}_p, +)$ of prime order which are closed under the composition with the clone generated by $+$ from both sides. Thereby, we also get a description of all iterative…

Rings and Algebras · Mathematics 2019-09-16 Sebastian Kreinecker

In this paper we study algebraic and asymptotic properties of generating sets of algebras over orders in number fields. Let $A$ be an associative algebra over an order $R$ in an algebraic number field. We assume that $A$ is a free…

Rings and Algebras · Mathematics 2010-01-19 Rostyslav V. Kravchenko , Marcin Mazur , Bogdan V. Petrenko

In this paper independent sets of closure operations are introduced. We characterize minimal keys and antikeys of closure operations in terms of independent sets. We establish an expression on the connection between minimal keys and…

Discrete Mathematics · Computer Science 2020-04-07 Nguyen Hoang Son

We show that if a finite point set $P\subseteq \mathbb{R}^2$ has the fewest congruence classes of triangles possible, up to a constant $M$, then at least one of the following holds. (1) There is a $\sigma>0$ and a line $l$ which contains…

Combinatorics · Mathematics 2023-10-25 Sam Mansfield , Jonathan Passant

In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…

Logic in Computer Science · Computer Science 2023-06-22 Arnon Avron , Liron Cohen

We find generating functions the number of strings (words) containing a specified number of occurrences of certain types of order-isomorphic classes of substrings called subword patterns. In particular, we find generating functions for the…

Combinatorics · Mathematics 2007-05-23 A. Burstein , T. Mansour

A celebrated 1922 theorem of Kuratowski states that there are at most 14 distinct sets arising from applying the operations of complementation and closure, any number of times, in any order, to a subset of a topological space. In this paper…

General Topology · Mathematics 2011-09-12 Jeffrey Shallit , Ross Willard

In this paper we address the problem of generating all elements obtained by the saturation of an initial set by some operations. More precisely, we prove that we can generate the closure by polymorphisms of a boolean relation with a…

Computational Complexity · Computer Science 2015-09-22 Arnaud Mary , Yann Strozecki