Related papers: A Group Theory Proof of Pascal's Theorem

The goal of this paper is to lay the foundations for a combinatorial study, via orthogonal functions and intertwining operators, of category O for the rational Cherednik algebra of type G(r,p,n). As a first application, we give a…

We investigate the additive theory of the set $S = \{1^c, 2^c, \dots, N^c\}$ when $c$ is a real number. In the language of additive combinatorics, we determine the asymptotic behaviour of the additive energy of $S$. When $c$ is rational,…

We construct an addition and a multiplication on the set of planar binary trees, closely related to addition and multiplication on the integers. This gives rise to a new kind of (noncommutative) arithmetic theory. The price to pay for this…

Using condition of relativistic invariance, group theory and Clifford algebra the component Lorentz invariance generalized Dirac equation for a particle with arbitrary mass and spin is suggested, where In the case of half-integral spin…

In this article, we give a general construction of spectral triples from certain Lie group actions on unital C*-algebras. If the group G is compact and the action is ergodic, we actually obtain a real and finitely summable spectral triple…

In this paper an algebraic proof of Christoph's theorem is provided. This theorem from algebraic-geometry is about the existence of a finite automaton for computing coefficient of a series for an algebraic function.

We develop a (co)algebraic framework to study a family of process calculi with monadic branching structures and recursion operators. Our framework features a uniform semantics of process terms and a complete axiomatisation of semantic…

A Latin square of order $n$ with symbols $a_1,\ldots,a_n$ can be considered as a multiplication table for binary operation in the set $A=\{a_1,\ldots,a_n\}$. We prove that, if this operation is associative, then $A$ is a group.

We introduce a class of group-like objects and prove that Cayley Theorem on groups has a counterpart in the class of group-like objects.

In this article, I introduce a group-theoretical method to prove positivity of certain linear combinations (with coefficients generally lying in $\mathbb{C}$) of exponential functions under a set of semidefinite linear constraints. The…

We prove a {\Gamma}-equivariant version of the algebraic index theorem, where {\Gamma} is a discrete group of automorphisms of a formal deformation of a symplectic manifold. The particular cases of this result are the algebraic version of…

In this paper, continuous binary operations of a topological space are studied and a criterion of their invertibility is proved. The classification problem of groups of invertible continuous binary operations of locally compact and locally…

This short expository paper outlines applications of computer algebra to the implication problem of conditional independence for Gaussian random variables. We touch on certificates for validity and invalidity of inference rules from the…

This paper discusses limitations of reflexive and diagonal arguments as methods of proof of limitative theorems (e.g. G\"odel's theorem on Entscheidungsproblem, Turing's halting problem or Chaitin-G\"odel's theorem). The fact, that a formal…

It is well known that over an infinite field the ring of symmetric functions in a finite number of variables is isomorphic to the one of polynomial functions on matrices that are invariants by the action of conjugation by general linear…

Let G be any additive abelian group with cyclic torsion subgroup, and let A, B and C be finite subsets of G with cardinality n>0. We show that there is a numbering {a_i}_{i=1}^n of the elements of A, a numbering {b_i}_{i=1}^n of the…

A new proof for adjoint systems of linear equations is presented. The argument is built on the principles of Algorithmic Differentiation. Application to scalar multiplication sets the base line. Generalization yields adjoint inner vector,…

We demonstrate how a generic automated theorem prover can be applied to establish the non-orderability of groups. Our approach incorporates various tools such as positive cones, torsions, generalised torsions and cofinal elements.

In this paper we present a variety of statements that are in the spirit of the famous theorem of Pascal, often referred to as the Mystic Hexagon. We give explicit equations describing the conditions for $d+4$ points to lie on rational…

A {\em cyclic graph} is a graph with at each vertex a cyclic order of the edges incident with it specified. We characterize which real-valued functions on the collection of cubic cyclic graphs are partition functions of a real vertex model…