相关论文: Combinatorial Representation Theory

A summary of the construction procedure of generalized versions of Baxter's Q-operator is given. Illustrated by several figures and diagrams the use of representation theory is explained step-by-step avoiding technical details. The relation…

Adaptive behavior often requires predicting future events. The theory of reinforcement learning prescribes what kinds of predictive representations are useful and how to compute them. This paper integrates these theoretical ideas with work…

We survey results on the hardness of approximating combinatorial optimization problems.

This paper surveys current technology and research in the area of digital color imaging. In order to establish the background and lay down terminology, fundamental concepts of color perception and measurement are first presented us-ing…

In this paper I consider the polymorpism of representations of universal algebra and tensor product of representations of universal algebra.

Deep learning has been the subject of growing interest in recent years. Specifically, a specific type called Multimodal learning has shown great promise for solving a wide range of problems in domains such as language, vision, audio, etc.…

In this chapter I discuss the impact of concepts of Quantum Field Theory in modern Condensed Physics. Although the interplay between these two areas is certainly not new, the impact and mutual cross-fertilization has certainly grown…

We define generalized vector fields, and contraction and Lie derivatives with respect to them. Generalized commutators are also defined.

Computer simulations are enabling researchers to investigate systems which are extremely difficult to handle analytically. In the particular case of General Relativity, numerical models have proved extremely valuable for investigations of…

Random graphs have proven to be one of the most important and fruitful concepts in modern Combinatorics and Theoretical Computer Science. Besides being a fascinating study subject for their own sake, they serve as essential instruments in…

The theory of pictures between posets is known to encode much of the combinatorics of symmetric group representations and related topics such as Young diagrams and tableaux. Many reasons, com-binatorial (e.g. since semi-standard tableaux…

A representation field for a non-maximal order $\Ha$ in a central simple algebra is a subfield of the spinor class field of maximal orders which determines the set of spinor genera of maximal orders containing a copy of $\Ha$. Not every…

We give a proposal for future development of the model theory of valued fields. We also summarize some recent results on p-adic numbers.

This article is a short review on the relationship between convergent matrix integrals, formal matrix integrals, and combinatorics of maps. We briefly summarize results developed over the last 30 years, as well as more recent discoveries.…

We study decision-making problems where data comprises points from a collection of binary polytopes, capturing aggregate information stemming from various combinatorial selection environments. We propose a nonparametric approach for…

We revisit the fundamental notion of continuity in representation theory, with special attention to the study of quantum physics. After studying the main theorem in the context of representation theory, we draw attention to the significant…

This is a survey of results on random group presentations, and on random subgroups of certain fixed groups. Being a survey, this paper does not contain new results, but it offers a synthetic view of a part of this very active field of…

We develop the theory of Wigner representations for general probabilistic theories (GPTs), a large class of operational theories that include both classical and quantum theory. The Wigner representations that we introduce are a natural way…

This is a survey on algorithmic questions about combinatorial and geometric properties of convex polytopes. We give a list of 35 problems; for each the current state of knowledege on its theoretical complexity status is reported. The…

We study the combinatorics of hyperplane arrangements over arbitrary fields. Specifically, we determine in which situation an arrangement and its reduction modulo a prime number have isomorphic lattices via the use of minimal strong…