中文
相关论文

相关论文: Zhuk's bridges, centralizers, and similarity

200 篇论文

This paper focuses on the algebraic theory underlying the study of the complexity and the algorithms for the Constraint Satisfaction Problem (CSP). We unify, simplify, and extend parts of the three approaches that have been developed to…

计算复杂性 · 计算机科学 2024-08-07 Libor Barto , Zarathustra Brady , Andrei Bulatov , Marcin Kozik , Dmitriy Zhuk

We develop a new theory of strong subalgebras and linear congruences that are defined globally. Using this theory we provide a new proof of the correctness of Zhuk's algorithm for all tractable CSPs on a finite domain, and therefore a new…

计算复杂性 · 计算机科学 2024-10-22 Dmitriy Zhuk

The Constraint Satisfaction Problem (CSP) has been intensively studied in many areas of computer science and mathematics. The approach to the CSP based on tools from universal algebra turned out to be the most successful one to study the…

逻辑 · 数学 2025-01-16 Andrei A. Bulatov

The CSP (constraint satisfaction problems) is a class of problems deciding whether there exists a homomorphism from an instance relational structure to a target one. The CSP dichotomy is a profound result recently proved by Zhuk (2020, J.…

逻辑 · 数学 2023-01-13 Azza Gaysin

The algebraic approach to the Constraint Satisfaction Problem (CSP) uses high order symmetries of relational structures -- polymorphisms -- to study the complexity of the CSP. In this paper we further develop one of the methods the…

计算机科学中的逻辑 · 计算机科学 2020-07-21 Andrei A. Bulatov

The constraint satisfaction problem (CSP) can be formulated as a homomorphism problem between relational structures: given a structure $\mathcal{A}$, for any structure $\mathcal{X}$, whether there exists a homomorphism from $\mathcal{X}$ to…

逻辑 · 数学 2024-03-12 Azza Gaysin

In analogy to the topological entropy for continuous endomorphisms of totally disconnected locally compact groups, we introduce a notion of topological entropy for continuous endomorphisms of locally linearly compact vector spaces. We study…

群论 · 数学 2021-01-22 Ilaria Castellano , Anna Giordano Bruno

We investigate the structure of connected graphs, not necessarily locally finite, with infinitely many ends. On the one hand we study end-transitive such graphs and on the other hand we study such graphs with the property that the…

组合数学 · 数学 2010-03-19 Matthias Hamann

We explain how to deduce the degenerate analogue of Ariki's categorification theorem over the ground field C as an application of Schur-Weyl duality for higher levels and the Kazhdan-Lusztig conjecture in finite type A. We also discuss some…

表示论 · 数学 2010-12-17 Jonathan Brundan , Alexander Kleshchev

The identification of nodes occupying important positions in a network structure is crucial for the understanding of the associated real-world system. Usually, betweenness centrality is used to evaluate a node capacity to connect different…

This is the first of three papers motivated by the author's desire to understand and explain "algebraically" one aspect of Dmitriy Zhuk's proof of the CSP Dichotomy Theorem. In this paper we study abelian congruences in varieties having a…

逻辑 · 数学 2026-01-21 Ross Willard

We study Constraint Satisfaction Problems (CSPs) in an infinite context. We show that the dichotomy between easy and hard problems -- established already in the finite case -- presents itself as the strength of the corresponding De…

We develop basic homological machinery for Z-algebras in order to prove a version of local duality for Ext-finite connected Z-algebras. As an application, we compare two notions of regularity for such algebras.

环与代数 · 数学 2023-05-17 Izuru Mori , Adam Nyman

For a finite subgroup $G$ of the special unitary group $SU_2$, we study the centralizer algebra $Z_k(G) = End_G(V^{\otimes k})$ of $G$ acting on the $k$-fold tensor product of its defining representation $V= \mathbb{C}^2$. These subgroups…

表示论 · 数学 2017-05-17 Jeffrey M. Barnes , Georgia Benkart , Tom Halverson

We develop the novel machinery of smooth approximations, and apply it to confirm the CSP dichotomy conjecture for first-order reducts of the random tournament, various homogeneous graphs including the random graph, and for expansions of the…

计算机科学中的逻辑 · 计算机科学 2021-06-08 Antoine Mottet , Michael Pinsker

We give a new proof of Zariski's multiplicity conjecture in the case of isolated hypersurface singularities; this was first proved by de Bobadilla-Pe\l ka \cite{BobadillaPelka}. Our proof uses the TQFT structure of fixed-point Floer…

辛几何 · 数学 2023-08-29 Shamuel Auyeung

Dmitriy Zhuk has proved that there exist relational structures which admit near-unanimity polymorphisms, but the minimum arity of such a polymorphism is large and almost matches the known upper bounds. We present a simplified and explicit…

逻辑 · 数学 2017-12-06 Libor Barto , Ondřej Draganov

For a totally disconnected locally compact abelian group, we prove that the topological entropy of a continuous endomorphism coincides with the algebraic entropy of the dual endomorphism with respect to the Pontryagin duality. Moreover,…

一般拓扑 · 数学 2013-10-25 Dikran Dikranjan , Anna Giordano Bruno

The purpose of this paper is to investigate the finite group which appears in the study of the Type II $\mathbf{Z}_4$-codes. To be precise, it is characterized in terms of generators and relations, and we determine the structure of the…

表示论 · 数学 2017-06-08 Masashi Kosuda , Manabu Oura

This document is a thesis presented for the ``Habilitation \`a diriger des recherches''. The first chapter provides some background and sketch the story of the classical Schur-Weyl duality and its quantum analogue involving the Hecke…

表示论 · 数学 2023-04-04 L. Poulain d'Andecy
‹ 上一页 1 2 3 10 下一页 ›