Related papers: PFA(S)[S] and the Arhangel'skii-Tall problem
We study the spectral Tur\'an problem for trees. To avoid limiting our perspective to specific families of trees, we parametrize trees in terms of their unique bipartition. We say $T \in \mathcal{T}_{m,l+1}^{\delta}$ if $T$ is a tree of…
We give combinatorial criteria for predicting the transcendental weight of Feynman integrals of certain graphs in $\phi^4$ theory. By studying spanning forest polynomials, we obtain operations on graphs which are weight-preserving, and a…
The computational complexity of the isomorphism problem for regular trees, regular linear orders, and regular words is analyzed. A tree is regular if it is isomorphic to the prefix order on a regular language. In case regular languages are…
Let $A$ be a unital separable simple \CA with $\tr(A)\le 1$ and $\alpha$ be an automorphism. We show that if $\alpha$ satisfies the tracially cyclic Rokhlin property then $\tr(A\rtimes_{\alpha}\Z)\le 1.$ We also show that whenever $A$ has a…
We prove that Simulated Annealing with an appropriate cooling schedule computes arbitrarily tight constant-factor approximations to the minimum spanning tree problem in polynomial time. This result was conjectured by Wegener (2005). More…
We show it is consistent that there is a Souslin tree $S$ such that after forcing with $S$, $S$ is Kurepa and for all clubs $C \subset \omega_1$, $S\upharpoonright C$ is rigid. This answers Fuchs's questions in Club degrees of rigidity and…
It is commonly known that the Fokker-Planck equation is exactly solvable only for some particular systems, usually with time-independent drift coefficients. To extend the class of solvable problems, we use the intertwining relations of SUSY…
Working in any model theoretic structure, we single out a class of definable bipartite graphs that admit definable, close to perfect matchings. We use this result to prove a strengthening of Tarski's theorem for the definable setting.
We prove that there are groups in the constructible universe whose automorphism towers are highly malleable by forcing. This is a consequence of the fact that, under a suitable diamond hypothesis, there are sufficiently many highly rigid…
In this paper, we derive recurrence relations of forcing polynomials for monotonic CHS and the other is CHS with one turning.
Extensions of Lie algebras equipped with Sasakian or Frobenius-K\"ahler geometrical structures are studied. Conditions are given so that a double extension of a Sasakian Lie algebra be Sasakian again. Conditions are also given for obtaining…
We generalize the notion of semi-universality in the classical deformation problems to the context of derived deformation theories. A criterion for a formal moduli problem to be semi-prorepresentable is produced. This can be seen as an…
Motivated by the goal of constructing a model in which there are no $\kappa$-Aronszajn trees for any regular $\kappa>\aleph_1$, we produce a model with many singular cardinals where both the singular cardinals hypothesis and weak square…
We present SGDPLL(T), an algorithm that solves (among many other problems) probabilistic inference modulo theories, that is, inference problems over probabilistic models defined via a logic theory provided as a parameter (currently,…
An algebraic telic problem is a decision problem in $\textsf{NP}_\mathbb{R}$ formalizing finite-time reachability questions for one-dimensional dynamical systems. We prove that the existence of "natural" mapping reductions between algebraic…
We study the complexity of problems solvable in deterministic polynomial time with access to an NP or Quantum Merlin-Arthur (QMA)-oracle, such as $P^{NP}$ and $P^{QMA}$, respectively. The former allows one to classify problems more finely…
In this paper, we present numerical procedures to compute solutions of partial differential equations posed on fractals. In particular, we consider the strong form of the equation using standard graph Laplacian matrices and also weak forms…
Proving a conjecture of Talagrand, a fractional version of the 'expectation-threshold' conjecture of Kalai and the second author, we show for any increasing family $F$ on a finite set $X$ that $p_c (F) =O( q_f (F) \log \ell(F))$, where…
We implement a version of conformal field theory in a doubly connected domain to connect it to the theory of annulus SLE of various types, including the standard annulus SLE, the reversible annulus SLE, and the annulus SLE with several…
We study principles of the form: if a name $\sigma$ is forced to have a certain property $\varphi$, then there is a ground model filter $g$ such that $\sigma^g$ satisfies $\varphi$. We prove a general correspondence connecting these name…