English
Related papers

Related papers: Mathias forcing and combinatorial covering propert…

200 papers

We present three natural combinatorial properties for class forcing notions, which imply the forcing theorem to hold. We then show that all known sufficent conditions for the forcing theorem (except for the forcing theorem itself),…

Logic · Mathematics 2017-10-31 Peter Holy , Regula Krapf , Philipp Schlicht

A question of Bergman asks whether the adjoint of the generic square matrix over a field can be factored nontrivially as a product of square matrices. We show that such factorizations indeed exist over any coefficient ring when the matrix…

Commutative Algebra · Mathematics 2007-05-23 Ragnar-Olaf Buchweitz , Graham J. Leuschke

Composite wires with a three-layered structure are known to show a particularly large magnetoimpedance effect. The wires consist of a highly conductive core, an insulating layer and an outer ferromagnetic shell. In order to understand the…

Materials Science · Physics 2013-01-21 Ralf Betzholz , Haibin Gao , Zhenjie Zhao , Uwe Hartmann

The application of binary matrices are numerous. Representing a matrix as a mixture of a small collection of latent vectors via low-rank decomposition is often seen as an advantageous method to interpret and analyze data. In this work, we…

Numerical Analysis · Mathematics 2021-11-03 Derek DeSantis , Erik Skau , Duc P. Truong , Boian Alexandrov

In [1] the authors showed some basic properties of a pre-order that arose in combinatorial number theory, namely the finite embeddability between sets of natural numbers, and they presented its generalization to ultrafilters, which is…

Logic · Mathematics 2014-06-13 Lorenzo Luperi Baglini

Branes and defects in topological Landau-Ginzburg models are described by matrix factorisations. We revisit the problem of deforming them and discuss various deformation methods as well as their relations. We have implemented these…

High Energy Physics - Theory · Physics 2012-06-28 Nils Carqueville , Laura Dowdy , Andreas Recknagel

Matrix factorization is a widely used approach for top-N recommendation and collaborative filtering. When implemented on implicit feedback data (such as clicks), a common heuristic is to upweight the observed interactions. This strategy has…

Information Retrieval · Computer Science 2025-10-14 Alex Ayoub , Samuel Robertson , Dawen Liang , Harald Steck , Nathan Kallus

We prove that the Hurewicz property is not preserved by finite products in the Miller model. This is a consequence of the fact that Miller forcing preserves ground model $\gamma$-spaces.

General Topology · Mathematics 2019-09-18 Dušan Repovš , Lyubomyr Zdomskyy

Suppose a map $\phi$ on the set of positive definite matrices satisfies $\det(A+B)=\det(\phi(A)+\phi(B))$. Then we have $${\rm tr}(AB^{-1}) = {\rm tr}(\phi(A){\phi(B)}^{-1}).$$ Through this viewpoint, we show that $\phi$ is of the form…

Rings and Algebras · Mathematics 2016-03-15 Huajun Huang , Chih-Neng Liu , Patricia Szokol , Ming-Cheng Tsai , Jun Zhang

Let $F$ be a $p$-adic field. Let $\mathcal{R}$ be the Grothendieck ring of complex smooth finite-length representations of the groups $\{GL_n(F)\}_{n=0}^\infty$ taken together, with multiplication defined in the sense of parabolic…

Representation Theory · Mathematics 2016-04-26 Maxim Gurevich

We show the consistency of ZFC +''there is no NWD-ultrafilter on omega'', which means: for every non principle ultrafilter D on the set of natural numbers, there is a function f from the set of natural numbers to the reals, such that for…

Logic · Mathematics 2009-09-25 Saharon Shelah

In this paper we propose a procedure which allows the construction of a large family of FIR d x d matrix wavelet filters by exploiting the one-to-one correspondence between QMF systems and orthogonal operators which commute with the shifts…

Numerical Analysis · Mathematics 2013-03-06 Mariantonia Cotronei , Matthias Holschneider

We prove that a large class of presaturated ideals at inaccessible cardinals can be de-saturated while preserving their presaturation, answering both a question of Foreman and of Cox and Eskew. We do so by iterating a generalized version of…

Logic · Mathematics 2021-04-21 Noah Schoem

In this paper we define and explore properties of mixed multiplicities of (not necessarily Noetherian) filtrations of $m_R$-primary ideals in a Noetherian local ring $R$, generalizing the classical theory for $m_R$-primary ideals. We…

Commutative Algebra · Mathematics 2019-01-23 Steven Dale Cutkosky , Parangama Sarkar , Hema Srinivasan

A 1965 result of Crapo shows that every elementary lift of a matroid $M$ can be constructed from a linear class of circuits of $M$. In a recent paper, Walsh generalized this construction by defining a rank-$k$ lift of a matroid $M$ given a…

Combinatorics · Mathematics 2025-02-19 Daniel Irving Bernstein , Zach Walsh

The main result of this paper is a partial answer to [math.LO/9909115, Problem 5.5]: a finite iteration of Universal Meager forcing notions adds generic filters for many forcing notions determined by universality parameters. We also give…

Logic · Mathematics 2013-01-04 Andrzej Roslanowski , Saharon Shelah

Let $M$ be a matroid satisfying a matroidal analogue of the Cayley-Bacharach condition. Given a number $k \ge 2$, we show that there is no nontrivial bound on ranks of a $k$-tuple of flats covering the underlying set of $M$. This addresses…

Combinatorics · Mathematics 2022-11-15 Soohyun Park

Although some work has been done on the metamathematics of Metamath, there has not been a clear definition of a model for a Metamath formal system. We define the collection of models of an arbitrary Metamath formal system, both for…

Logic · Mathematics 2016-05-10 Mario Carneiro

The behavior of factorization properties in various ring extensions is a central theme in commutative algebra. Classically, the UFDs are (completely) integrally closed and tend to behave well in standard ring extensions, with the notable…

Commutative Algebra · Mathematics 2025-04-16 Jason Boynton , Jim Coykendall , Grant Moles , Chelsey Morrow

The tower number $\mathfrak t$ and the ultrafilter number $\mathfrak u$ are cardinal characteristics from set theory. They are based on combinatorial properties of classes of subsets of~$\omega$ and the almost inclusion relation…

Logic · Mathematics 2024-10-07 Steffen Lempp , Joseph S. Miller , Andre Nies , Mariya Soskova
‹ Prev 1 3 4 5 6 7 10 Next ›