相关论文: Combinatorial specifications for juxtapositions of…

Our main observation is that the contravariant functor Spec on the category of commutative monoids is representable. We discuss a few consequences of this fact. In particular, we give an efficient way of calculating the Spec(M) of a…

In this note we focus on combinatorial aspects of plus-one generated line arrangements. We provide combinatorial constraints on such arrangements and we construct a polynomial that decodes the plus-one generated property. We present new…

Recall that an excedance of a permutation $\pi$ is any position $i$ such that $\pi_i > i$. Inspired by the work of Hopkins, McConville and Propp (Elec. J. Comb., 2017) on sorting using toppling, we say that a permutation is toppleable if it…

Babson and Steingr\'{\i}msson introduced generalized permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. Claesson presented a complete solution for the number of…

Let R be a commutative ring with unity, M be an unitary R-module and {\Gamma} be a simple graph. This research article is an interplay of combinatorial and algebraic properties of M . We show a combinatorial object completely determines an…

Representing a proof tree by a combinator term that reduces to the tree lets subtle forms of duplication within the tree materialize as duplicated subterms of the combinator term. In a DAG representation of the combinator term these…

Given a category C of a combinatorial nature, we study the following fundamental question: how does the combinatorial behavior of C affect the algebraic behavior of representations of C? We prove two general results. The first gives a…

Let G be a graph, and let $\chi$G be its chromatic polynomial. For any non-negative integers i, j, we give an interpretation for the evaluation $\chi$ (i) G (--j) in terms of acyclic orientations. This recovers the classical interpretations…

Given a nonnegative integer $m$ and a finite collection ${\mathcal A}$ of linear forms on ${\mathbb Q}^d$, the arrangement of affine hyperplanes in ${\mathbb Q}^d$ defined by the equations $\alpha(x) = k$ for $\alpha \in {\mathcal A}$ and…

We study a form of refined class number formula (resp. type number formula) for maximal orders in totally definite quaternion algebras over real quadratic fields, by taking into consideration the automorphism groups of right ideal classes…

This work introduces a new class of symmetric matrix structures, called harmonic structures, which enable the generation of all possible directed transitions $(x_i, x_{i+1})$ over a set of $n$ symbols, without internal repetitions. Unlike…

We present a numerical method for solving the Poisson equation on a nested grid. The nested grid consists of uniform grids having different grid spacing and is designed to cover the space closer to the center with a finer grid. Thus our…

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…

We prove a combination theorem for hyperbolic groups, in the case of groups acting on complexes displaying combinatorial features reminiscent of non-positive curvature. Such complexes include for instance weakly systolic complexes and…

We determine the permutation groups that arise as the automorphism groups of cyclic combinatorial objects. As special cases we classify the automorphism groups of cyclic codes. We also give the permutations by which two cyclic combinatorial…

Additive CA on a cylinder of size $n$ can be represented by 01-string $V$ of length $n$ which is its rule. We study a problem: a class $S$ of rules given, for any $V\in S$ describe all sizes $n', n'>n,$ of cylinders such that extension of…

We discuss here some computational aspects of the Combinatorial Nullstellensatz argument. Our main result shows that the order of magnitude of the symmetry group associated with permutations of the variables in algebraic constraints,…

We define the operation of composing two hereditary classes of permutations using the standard composition of permutations as functions and we explore properties and structure of permutation classes considering this operation. We mostly…

In various application fields, such as fluid-, cell-, or crowd-simulations, spatial data structures are very important. They answer nearest neighbor queries which are instrumental in performing necessary computations for, e.g., taking the…

We show that every combinatorial model category can be obtained, up to Quillen equivalence, by localizing a model category of diagrams of simplicial sets. This says that any combinatorial model category can be built up from a category of…