Related papers: A Note on Matching in Groups and Field Extensions
We develop the theory of linear evolution equations associated with the adjacency matrix of a graph, focusing in particular on infinite graphs of two kinds: uniformly locally finite graphs as well as locally finite line graphs. We discuss…
These are notes on some entanglement properties of quantum field theory, aiming to make accessible a variety of ideas that are known in the literature. The main goal is to explain how to deal with entanglement when -- as in quantum field…
Random matrices now play a role in many parts of computational mathematics. To advance these applications, it is desirable to have tools that are flexible, easy to use, and powerful. Over the last 25 years, researchers have developed a…
Sometimes we obtain attractive results when associating facts to simple elements. The goal of this work is to introduce a possible alternative in the study of the dynamics of rational maps.
Field theory is an area in physics with a deceptively compact notation. Although general purpose computer algebra systems, built around generic list-based data structures, can be used to represent and manipulate field-theory expressions,…
The origins of the notion of matchings in groups spawn from a linear algebra problem proposed by E. K. Wakeford [24] which was tackled in 1996 [10]. In this paper, we first discuss unmatchable subsets in abelian groups. Then we formulate…
A matching from a finite subset $A$ of an abelian group $G$ to another subset $B$ is a bijection $f : A \to B$ such that $af(a) \notin A$ for all $a \in A$. The study of matchings began in the 1990s and was motivated by a conjecture of E.…
An equivalence relation in the symmetric group, where is a positive integer has been considered. An algorithm for calculation of the number of the equivalence classes by this relation for arbitrary integer has been described.
The goal of this Section is to formulate some of the basic results on the theory of integral equations and mention some of its applications. The literature of this subject is very large. Proofs are not given due to the space restriction.…
The point of view of these notes on the topic is to bring out the flavour that Representation Theory is an extension of the first course on Group Theory. We also emphasize the importance of the base field. These notes cover completely the…
The main goal of this note is to provide a new proof of a classical result about projectivities between finite abelian groups. It is based on the concept of fundamental group lattice, studied in our previous papers \cite{8} and \cite{9}. A…
Matching is a method of the design of experiments. If we had an even number of patients and wanted to form pairs of patients such that their ages, for example, in each pair be as close as possible, we would use nonbipartite matching. Not…
Matchings were among the earliest motivations for graph theory. They subsequently remained a central goal, inspiring the development of new tools that went well beyond problems directly concerning matchings. These tools proved widely…
A theory, graphical notation, mathematical calculus and implementation for finding whether two given expressions can, at execution time, denote references attached to the same object. Intended as the basis for a comprehensive solution to…
This note presents an approach to studying the iterates of a mapping whose restriction to the complement of a finite set is continuous and open. The main examples to which the approach can be applied are piecewise monotone mappings defined…
Any permutation has a disjoint cycle decomposition and concept generates an equivalence class on the symmetry group called the cycle-type. The main focus of this work is on permutations of restricted cycle-types, with particular emphasis on…
Group theory is a particularly fertile field for the design of practical algorithms. Algorithms have been developed across the various branches of the subject and they find wide application. Because of its relative maturity, computational…
The purpose of these notes is to give a categorical presentation/analysis of homotopy type theory. The notes are incomplete as they stand (October 2017). The chapter on univalent tribes is missing. The references are not always connected to…
The paper aims at finding acyclic graphs under a given set of constraints. More specifically, given a propositional formula {\phi} over edges of a fixed-size graph, the objective is to find a model of {\phi} that corresponds to a graph that…
The purpose of this note is to attach a name to a natural class of combinatorial problems and to point out that this class includes many important special cases. We also show that a simple problem of placing nonoverlapping labels on a…