Related papers: PFA(S)[S] and the Arhangel'skii-Tall problem
Kontsevich conjectured that the number f(G,q) of zeros over the finite field with q elements of a certain polynomial connected with the spanning trees of a graph G is polynomial function of q. We have been unable to settle Kontsevich's…
The general/finite PCTL satisfiability problem asks whether a given PCTL formula has a general/finite model. We show that the finite PCTL satisfiability problem is undecidable, and the general PCTL satisfiability problem is even highly…
The main result of the paper is a description of conormal Lie algebras of Feigin-Odesskii Poisson structures. In order to obtain it we introduce a new variant of a definition of a Feigin-Odesskii Poisson structure: we define it using a…
Assuming $\rm PFA$, we shall use internally club $\omega_1$-guessing models as side conditions to show that for every tree $T$ of height $\omega_2$ without cofinal branches, there is a proper and $\aleph_2$-preserving forcing notion with…
Let $\pi$ be a simple supercuspidal representation of the symplectic group $Sp_{2l}(F)$, over a $p$-adic field $F$. In this work, we explicitly compute the Rankin-Selberg $\gamma$-factor of rank-$1$ twists of $\pi$. We then completely…
Using the formalism of Newton hyperplane arrangements, we resolve the open questions regarding angle rank left over from [DKRV20]. As a consequence we end up generalizing theorems of Lenstra--Zarhin and Tankeev proving several new cases of…
We continue the study of token sliding reconfiguration graphs of independent sets initiated by the authors in an earlier paper (arXiv:2203.16861). Two of the topics in that paper were to study which graphs $G$ are token sliding graphs and…
We consider logic-based argumentation in which an argument is a pair (Fi,al), where the support Fi is a minimal consistent set of formulae taken from a given knowledge base (usually denoted by De) that entails the claim al (a formula). We…
We obtain a relatively simple criterion for when a forcing has the ${<}\,\delta$-approximation property, generalizing a result of Unger. Afterwards we apply this criterion to construct variants of Mitchell Forcing in order to answer…
We are lifting classical problems from single instances to regular sets of instances. The task of finding a positive instance of the combinatorial problem $P$ in a potentially infinite given regular set is equivalent to the so called…
An encoding of directed acyclic graphs (DAGs) on labeled vertices is proposed, which is a generalisation of the Pr\"ufer code for labeled trees, if a certain orienation on the edges of the tree is introduced. Hence it is shown that the…
Equivariant tree models are statistical models used in the reconstruction of phylogenetic trees from genetic data. Here equivariant refers to a symmetry group imposed on the root distribution and on the transition matrices in the model. We…
'Tree-based' phylogenetic networks proposed by Francis and Steel have attracted much attention of theoretical biologists in the last few years. At the heart of the definitions of tree-based phylogenetic networks is the notion of 'support…
Solving of regular equations via Arden's Lemma is folklore knowledge. We first give a concise algorithmic specification of all elementary solving steps. We then discuss a computational interpretation of solving in terms of coercions that…
In this article, we investigate the weighted Steklov eigenvalue problem and the weighted Schr\"odinger--Steklov eigenvalue problem in outward cuspidal domains. We prove the solvability of these spectral problems in both linear and…
Assuming that there is no inner model with a strong cardinal, the following is shown: any subset of \omega_1 can be made \Delta^1_3 (in the codes) by a reasonable set-forcing; there is a reasonable set-generic extension with a \Delta^1_3…
We discuss the computational complexity of solving linear programming problems by means of an analog computer. The latter is modeled by a dynamical system which converges to the optimal vertex solution. We analyze various probability…
We propose interconnections between some problems of PDE, geometry, algebra, calculus and physics. Uniqueness of a solution of the Dirichlet problem and of some other boundary value problems for the string equation inside an arbitrary…
We address the decision problem for a fragment of real analysis involving differentiable functions with continuous first derivatives. The proposed theory, besides the operators of Tarski's theory of reals, includes predicates for…
In this paper, we first prove relation between analytic and co-analytic part of the class harmonic univalent functions S_H(S):={f = h+\overline g|h is element of S} by means of second dilatation is constant. Next, we verify the coefficient…