相关论文: Study of an identity
We develop an algorithm for recognizing whether a character belongs to $\Sigma^m$. In order to apply it we just need to know that the ambient group is of type $\mathrm{FP}_m$ or of type $\mathrm{F}_2$ and that the word problem is solvable…
We study groups, exponential groups and ordered groups equipped with valuations. We investigate algebraic and topological features of such valued structures, and apply our findings in order to solve regular equations over groups using…
In standard first order predicate logic with identity it is usually taken that $a=a$ is a theorem for any term $a$. It is easily shown that this enables the apparent proof of a theorem stating the existence of any entity whatsoever. This…
Ranking individuals based on their performance in different coalitions is a problem emerging in various domains (teams sports, scientific evaluation, argumentation, etc.). Often, for practical reasons, the number of comparable coalitions is…
This paper revisits the multi-agent epistemic logic presented in [10], where agents and sets of agents are replaced by abstract, intensional "names". We make three contributions. First, we study its model theory, providing adequate notions…
An important problem in geometric reasoning is to find the configuration of a collection of geometric bodies so as to satisfy a set of given constraints. Recently, it has been suggested that this problem can be solved efficiently by…
We introduce the identity labeling problem - given an individual in a social situation, can we predict what identity(ies) they will be labeled with by someone else? This problem remains a theoretical gap and methodological challenge,…
Let $K \langle X\rangle$ be the free associative algebra freely generated over the field $K$ by the countable set $X = \{x_1, x_2, \ldots\}$. If $A$ is an associative $K$-algebra, we say that a polynomial $f(x_1,\ldots, x_n) \in K \langle…
We explore the connection between an agent's decision problem and her ranking of information structures. We find that a finite amount of ordinal data on the agent's ranking of experiments is enough to identify her (finite) set of…
Let $G$ be a group. Two elements $x, y$ are said to be {\it $z$-equivalent} if their centralizers are conjugate in $G$. The class equation of $G$ is the partition of $G$ into conjugacy classes. Further decomposition of conjugacy classes…
Separability for groups refers to the question which subsets of a group can be detected in its finite quotients. Classically, separability is studied in terms of which classes have a certain separability property, and this question is…
We propose to address the problem of how to know students' knowledge in an entirely new approach called ?epistemography? which is, roughly, an attempt to describe the structure of this knowledge. We claim that what is to be known is made of…
Let $\Sigma = X\cup X^{-1} = \{ x_1 ,x_2 ,..., x_m ,x_1^{-1} ,x_2^{-1} ,..., x_m^{-1} \}$ and let $G$ be a group with set of generators $\Sigma$. Let $\mathfrak{L} (G) =\left\{ \left. \omega \in \Sigma^* \; \right\vert \;\omega \equiv e \;…
In this work, we study generalized entropies and information geometry in a group-theoretical framework. We explore the conditions that ensure the existence of some natural properties and at the same time of a group-theoretical structure for…
A tautological system, introduced in \cite{LSY}\cite{LY}, arises as a regular holonomic system of partial differential equations that govern the period integrals of a family of complete intersections in a complex manifold $X$, equipped with…
In this paper we study several closely related fundamental problems for words and matrices. First, we introduce the Identity Correspondence Problem (ICP): whether a finite set of pairs of words (over a group alphabet) can generate an…
We prove that a knowledge of the character degrees of a finite group G and of their multiplicities determines whether G has a Sylow p-subgroup as a direct factor. An analogous result based on a knowledge of the conjugacy class sizes was…
We find polynomial-time solutions to the word problem for free-by-cyclic groups, the word problem for automorphism groups of free groups, and the membership problem for the handlebody subgroup of the mapping class group. All of these…
It is shown that an aspect of the process of individuation may be thought of as a fuzzy set. The process of individuation has been interpreted as a two-valued problem in the history of philosophy. In this work, I intend to show that such a…
We study polynomial identities satisfied by the mutation product $xpy - yqx$ on the underlying vector space of an associative algebra $A$, where $p, q$ are fixed elements of $A$. We simplify known results for identities in degree $4$,…