English
Related papers

Related papers: $\Delta^1_1$ Effectivization in Borel Combinatoric…

200 papers

The study of Borel equivalence relations under Borel reducibility has developed into an important area of descriptive set theory. The dichotomies of Silver and Harrington-Kechris-Louveau show that with respect to Borel reducibility, any…

Logic · Mathematics 2009-07-07 Ekaterina B. Fokina , Sy-David Friedman , Asger Tornquist

Using results from theory of operators on a Hilbert space, we prove approximation results for matrix-valued holomorphic functions on the unit disc and the unit bidisc. The essential tools are the theory of unitary dilation of a contraction…

Complex Variables · Mathematics 2023-06-27 Daniel Alpay , Tirthankar Bhattacharyya , Abhay Jindal , Poornendu Kumar

We study symmetric function analogues of the higher order Bell numbers. Their construction involves iterated plethystic exponential towers mimicking the single variable exponential generating functions for the higher order Bell numbers. We…

Combinatorics · Mathematics 2025-09-23 Milo Bechtloff Weising

Based on results by Brugall\'e and Mikhalkin, Fomin and Mikhalkin give formulas for computing classical Severi degrees $N^{d, \delta}$ using long-edge graphs. In 2012, Block, Colley and Kennedy considered the logarithmic version of a…

Combinatorics · Mathematics 2014-01-08 Fu Liu

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…

Logic · Mathematics 2025-08-15 Hannes Jakob

An extension of the Lorentz group that includes generators $\Gamma^\mu$ carrying a space-time index has been previously demonstrated to \emph{explicitly} construct the Minkowski metric \emph{within} the internal group space as a consequence…

General Physics · Physics 2024-03-19 James Lindesay

Jeffery's 1861 computations using finite difference calculus are resurrected and extended from forward differences to general delta operators and used to neatly prove theorems in the Rota--Mullins theory of polynomials of binomial type…

Combinatorics · Mathematics 2013-07-19 J. S. Dowker

We prove a complexity dichotomy theorem for Holant Problems on 3-regular graphs with an arbitrary complex-valued edge function. Three new techniques are introduced: (1) higher dimensional iterations in interpolation; (2) Eigenvalue Shifted…

Computational Complexity · Computer Science 2011-08-09 Michael Kowalczyk , Jin-Yi Cai

Efficient computation methods are devised for the perturbative solution of Schwinger--Dyson equations for propagators. We show how a simple computation allows to obtain the dominant contribution in the sum of many parts of previous…

High Energy Physics - Theory · Physics 2010-09-30 Marc Bellon

We show how lattice paths and the reflection principle can be used to give easy proofs of unimodality results. In particular, we give a "one-line" combinatorial proof of the unimodality of the binomial coefficients. Other examples include…

Combinatorics · Mathematics 2007-05-23 Bruce Sagan

We develop a correspondence between the study of Borel equivalence relations induced by closed subgroups of $S_\infty$, and the study of symmetric models and weak choice principles, and apply it to prove a conjecture of…

Logic · Mathematics 2020-11-26 Assaf Shani

In this paper, we study the problem of monotone (weakly) DR-submodular continuous maximization. While previous methods require the gradient information of the objective function, we propose a derivative-free algorithm LDGM for the first…

Machine Learning · Computer Science 2019-02-26 Yibo Zhang , Chao Qian , Ke Tang

In this paper we show how gauge symmetries in an effective theory can be used to simplify proofs of factorization formulae in highly energetic hadronic processes. We use the soft-collinear effective theory, generalized to deal with…

High Energy Physics - Phenomenology · Physics 2009-11-07 Christian W. Bauer , Sean Fleming , Dan Pirjol , Ira Z. Rothstein , Iain W. Stewart

We prove the Strengthened Hanna Neumann Conjecture, in its common graph theoretic formulation. Our original approach to this conjecture used cohomology of sheaves on graphs, although here we give a short combinatorial proof that we found in…

Combinatorics · Mathematics 2011-04-15 Joel Friedman

We give a formula for a birational map on the Schubert cell associated to each Weyl group element of $G=\text{GL}(n)$. The map simplifies the UDL decomposition of matrices, providing structural insight into the Schubert cell decomposition…

Representation Theory · Mathematics 2024-12-24 Doyon Kim

This paper is devoted to systematic studies of some extensions of first-order G\"odel logic. The first extension is the first-order rational G\"odel logic which is an extension of first-order G\"odel logic, enriched by countably many…

$\bar\partial$-extension of the matrix Riemann-Hilbert method is used to study asymptotics of the polynomials $P_n(z)$ satisfying orthogonality relations \[ \int_{-1}^1 x^lP_n(x)\frac{\rho(x)dx}{\sqrt{1-x^2}}=0, \quad l\in\{0,\ldots,n-1\},…

Classical Analysis and ODEs · Mathematics 2022-02-22 Maxim L. Yattselev

We prove a number of results about countable Borel equivalence relations with forcing constructions and arguments. These results reveal hidden regularity properties of Borel complete sections on certain orbits. As consequences they imply…

Logic · Mathematics 2015-03-27 Su Gao , Steve Jackson , Edward Krohne , Brandon Seward

Soft-collinear effective theory is used to prove factorization of the B->gamma+l+nu decay amplitude at leading power in Lambda/m_b, including a demonstration of the absence of non-valence Fock states and of the finiteness of the convolution…

High Energy Physics - Phenomenology · Physics 2008-11-26 S. W. Bosch , R. J. Hill , B. O. Lange , M. Neubert

We consider the problem of finding a homomorphism from an input digraph $G$ to a fixed digraph $H$. We show that if $H$ admits a weak near unanimity polymorphism $\phi$ then deciding whether $G$ admits a homomorphism to $H$ (HOM($H$)) is…

Computational Complexity · Computer Science 2020-11-24 Tomas Feder , Jeff Kinne , Ashwin Murali , Arash Rafiey
‹ Prev 1 2 3 10 Next ›