相关论文: Closures and generating sets related to combinatio…
Let R be the ring of algebraic integers in a number field K and let L be a maximal order in a semisimple K-algebra B. Building on our previous work, we compute the smallest number of algebra generators of L considered as an R-algebra. This…
A monoid $M$ generated by a set $S$ of symbols can be described as the set of equivalence classes of finite words in $S$ under some relations that specify when some contiguous sequence of symbols can be replaced by another. If $a,b\in S$, a…
We study bounded width algebras which are minimal in the sense that every proper reduct does not have bounded width. We show that minimal bounded width algebras can be arranged into a pseudovariety with one basic ternary operation. We…
A group is combable if it can be represented by a language of words satisfying a fellow traveller property; an automatic group has a synchronous combing which is a regular language. This paper gives a systematic analysis of the properties…
We study sets and groups definable in tame expansions of o-minimal structures. Let $\mathcal {\widetilde M}= \langle \mathcal M, P\rangle$ be an expansion of an o-minimal $\mathcal L$-structure $\cal M$ by a dense set $P$, such that three…
In this thesis we study three problems. The first is the superposition of the operators and their proprities, such as boundedness,continuity,regularity and the inequalities of the norms of the composition of functions in some functional…
We establish some interactions between uniformly recurrent subgroups (URSs) of a group $G$ and cosets topologies $\tau_\mathcal{N}$ on $G$ associated to a family $\mathcal{N}$ of normal subgroups of $G$. We show that when $\mathcal{N}$…
This paper argues that certain ontology design problems are profitably addressed by treating ontologies as theories and by defining a set of operations that create new ontologies, including their constraints, out of other ontologies. The…
In this document we achieve exact and asymptotic enumeration of words, compositions over a finite group, and/or integer compositions characterized by local restrictions and, separately, subsequence pattern avoidance. We also count…
We present a new fragment of axiomatic set theory for pure sets and for the iteration of power sets within given transitive sets. It turns out that this formal system admits an interesting hierarchy of models with true membership relation…
We develop tame topology over dp-minimal structures equipped with definable uniformities satisfying certain assumptions. Our assumptions are enough to ensure that definable sets are tame: there is a good notion of dimension on definable…
We focus on writing closed forms of generating functions for the number of partitions with gap conditions as double sums starting from a combinatorial construction. Some examples of the sets of partitions with gap conditions to be discussed…
We present a combinatorial structure of generators of $D(\mathcal{A}).$ This structure permits us to detect the relationship between the combinatorial determined property and the singularity of vector field. Consequently, by using only…
A certain analysis of all possible associative binary operations on N is presented. This is equivalent with an analysis of all possible monoid structures on N. Several results and a conjecture in this regard are given.
The aim of this thesis is to determine classes of NP relations for which random generation and approximate counting problems admit an efficient solution. Since efficient rank implies efficient random generation, we first investigate some…
For a complete, stable theory $T$ we construct, in a reasonably canonical way, a related stable theory $T^*$ which has higher independent amalgamation properties over the algebraic closure of the empty-set. The theory $T^*$ is an algebraic…
Collective versions of order convergences and corresponding types of collectively qualified sets of operators in vector lattices are investigated. It is proved that collectively order to norm bounded sets are bounded in the operator norm…
This dissertation is a contribution to the project of second-order set theory, which has seen a revival in recent years. The approach is to understand second-order set theory by studying the structure of models of second-order set theories.…
We deal with a family of functionals depending on curvatures and we prove for them compactness and semicontinuity properties in the class of closed and bounded sets which satisfy a uniform exterior and interior sphere condition. We apply…
Many groups possess highly symmetric generating sets that are naturally endowed with an underlying combinatorial structure. Such generating sets can prove to be extremely useful both theoretically in providing new existence proofs for…