Related papers: Hyperplanes in Configurations, decompositions, and…

We consider a general concept of composition and decomposition of objects, and discuss a few natural properties one may expect from a reasonable choice thereof. It will be demonstrated how this leads to multiplication and co- multiplication…

We study the problem of conjunctive query evaluation relative to a class of queries; this problem is formulated here as the relational homomorphism problem relative to a class of structures A, wherein each instance must be a pair of…

Consider Bernoulli(1/2) percolation on $\mathbb{Z}^d$, and define a perfect matching between open and closed vertices in a way that is a deterministic equivariant function of the configuration. We want to find such matching rules that make…

We present a bijective algorithm with which an arbitrary permutation decomposes canonically into elementary blocks which we call families, which are sets with a specified number of ascents and descents. We show that families, arranged in an…

Given a finite graph G and a topological space Z, the graphical configuration space Conf(G, Z) is the space of functions V(G) -> Z so that adjacent vertices map to distinct points. We provide a homotopy decomposition of Conf(G, X x Y) in…

Geometric vertex decomposition and liaison are two frameworks that have been used to produce similar results about similar families of algebraic varieties. In this paper, we establish an explicit connection between these approaches. In…

Recently Waegell and Aravind [J. Phys. A: Math. Theor. 45 (2012), 405301, 13 pages] have given a number of distinct sets of three-qubit observables, each furnishing a proof of the Kochen-Specker theorem. Here it is demonstrated that two of…

Recently geometric hypergraphs that can be defined by intersections of pseudohalfplanes with a finite point set were defined in a purely combinatorial way. This led to extensions of earlier results about points and halfplanes to…

We construct tree-decompositions of graphs that distinguish all their k-blocks and tangles of order k, for any fixed integer k. We describe a family of algorithms to construct such decompositions, seeking to maximize their diversity subject…

To any finite ordered subset and any finite partition of a group a set of tuples of positive integers, named as configurations, is associated that describes the group's behavior. The present paper provides an exposition of this notion and…

The notion of geometric construction is introduced. This notion allows to compare incidence configurations in the algebraic and tropical plane. We provide an algorithm such that, given a tropical instance of a geometric construction, it…

We describe the structure of triconnected graph with the help of its decomposition by 3-cutsets. We divide all 3-cutsets of a triconnected graph into rather small groups with a simple structure, named complexes. The detailed description of…

The classic way to write down Pascal's triangle leads to entries in alternating rows being vertically aligned. In this paper, we prove a linear dependence on vertically aligned entries in Pascal's triangle. Furthermore, we give an…

We introduce the general polynomial algebras characterizing a class of higher order superintegrable systems that separate in Cartesian coordinates. The construction relies on underlying polynomial Heisenberg algebras and their defining…

The functional decomposition of polynomials has been a topic of great interest and importance in pure and computer algebra and their applications. The structure of compositions of (suitably normalized) polynomials f=g(h) over finite fields…

This work deals with the presence of topological structures in models of two real scalar fields in the two-dimensional spacetime. The subject concerns the presence of a geometric constriction, which appears with a modification of the…

We investigate families of two-dimensional simplicial complexes defined in terms of vertex decompositions. They include nonevasive complexes, strongly collapsible complexes of Barmak and Miniam and analogues of 2-trees of Harary and Palmer.…

The partitioning of space by hyperplanes in the context of discrete classification problem is considered. We obtain some relations for the number of partitions and establish a recurrence relation for the maximal number of partitions of R^n…

This dissertation presents a multifaceted look into the structural decomposition of permutation classes. The theory of permutation patterns is a rich and varied field, and is a prime example of how an accessible and intuitive definition…

This is the first in a series of papers where we prove a conjecture of Deser and Schwimmer regarding the algebraic structure of ``global confor- mal invariants"; these are defined to be conformally invariant integrals of geometric scalars.…