相关论文: A human property (T) proof for high-rank $Aut(F_n)…

We show that the semidefinite programs involved in the computer proofs for Kazhdan's property (T) satisfy strong duality and that the dual programs have a geometric interpretation in terms of harmonic cocycles. By dualizing geometric…

We prove that $\operatorname{Aut}(F_n)$ has Kazhdan's property (T) for every $n \geqslant 6$. Together with a previous result of Kaluba, Nowak, and Ozawa, this gives the same statement for $n\geqslant 5$. We also provide explicit lower…

We prove that a group acting geometrically on a thick affine building has property (T). A more general criterion for property (T) is given for groups acting on partite complexes.

We review a minimum set of notions from our previous paper on structural properties of SAT at arXiv:0802.1790 that will allow us to define and discuss the "complete internal independence" of a decision problem. This property is strictly…

We study the automorphism group Aut(G) of a free product G of finite cyclic groups. We investigate the question in which cases Aut(G) has Serre's property FA. In the case of two or three free factors, we prove that Aut(G) does not have…

The impressive recent performance of large language models has led many to wonder to what extent they can serve as models of general intelligence or are similar to human cognition. We address this issue by applying GPT-3.5 and GPT-4 to a…

We use fast-growing finite and infinite sequences of natural numbers and more complicated constructs to define models of hypercomputation and interpret non-arithmetic predicates, with the strongest extensions reaching full second order…

We prove that, for the free algebra over a sufficiently rich operad, a large subgroup of its group of tame automorphisms has Kazhdan's property (T). We deduce that there exists a group with property (T) that maps onto large powers of…

We show that property (T) is not profinite, that is, we construct two finitely generated residually finite groups which have isomorphic profinite completions while one admits property (T) and the other does not. This settles a question…

We prove that in a countable theory T fully stable over a predicate P, any complete set A has the existence property. This means that A can be extended to a model of T without changing the P-part. In particular, T has the Gaifman property:…

We illustrate a general technique for enumerating factors of k-automatic sequences by proving a conjecture on the number f(n) of unbordered factors of the Thue-Morse sequence. We show that f(n) <= n for n >= 4 and that f(n) = n infinitely…

Hyperproperties lift conventional trace properties from a set of execution traces to a set of sets of execution traces. Hyperproperties have been shown to be a powerful formalism for expressing and reasoning about information-flow security…

For each Turing machine T, we construct an algebra A'(T) such that the variety generated by A'(T) has definable principal subcongruences if and only if T halts, thus proving that the property of having definable principal subcongruences is…

Utilizing the notion of property (T) we construct new examples of quantum group norms on the polynomial algebra of a compact quantum group, and provide criteria ensuring that these are not equal to neither the minimal nor the maximal norm.…

We prove that the notion of relative property (T) (or rigidity) for inclusions of finite von Neumann algebras defined in [Po1] is equivalent to a weaker property, in which no ``continuity constants'' are required. The proof is by…

We introduce the notion of property signatures, a representation for programs and program specifications meant for consumption by machine learning algorithms. Given a function with input type $\tau_{in}$ and output type $\tau_{out}$, a…

We show that each of Thompson's groups F, T, and V have infinitely many ends relative to certain subgroups. We go on to show that T and V both have Serre's property FA, i.e., any action of T or V on a tree will have a fixed point. (The…

Artificial intelligence (AI) tools based on large language models have acheived human-level performance on some computer programming tasks. We report several experiments using GPT-4 to generate computer code. These experiments demonstrate…

We construct a finitely presented group with property (T) which can not act on on reasonable spaces. Such group is constructed using an generalization of Hall embedding theorem, where property (T) is added at the expense of weakening the…

We show that a special case of the Feferman-Vaught composition theorem gives rise to a natural notion of automata for finite words over an infinite alphabet, with good closure and decidability properties, as well as several logical…