English
Related papers

Related papers: Three surprising instances of dividing

200 papers

The set splittability problem is the following: given a finite collection of finite sets, does there exits a single set that contains exactly half the elements from each set in the collection? (If a set has odd size, we allow the floor or…

Combinatorics · Mathematics 2019-09-17 Peter Bernstein , Cashous Bortner , Samuel Coskey , Shuni Li , Connor Simpson

We mechanize, in the proof assistant Isabelle, a proof of the axiom-scheme of Separation in generic extensions of models of set theory by using the fundamental theorems of forcing. We also formalize the satisfaction of the axioms of…

Logic in Computer Science · Computer Science 2019-01-11 Emmanuel Gunther , Miguel Pagano , Pedro Sánchez Terraf

In this article we investigate different forms of multiplicative independence between the sequences $n$ and $\lfloor n \alpha \rfloor$ for irrational $\alpha$. Our main theorem shows that for a large class of arithmetic functions $a, b…

Number Theory · Mathematics 2023-12-08 David Crnčević , Felipe Hernández , Kevin Rizk , Khunpob Sereesuchart , Ran Tao

We extend discrete Morse-Bott theory to the setting of loop-free (or acyclic) categories. First of all, we state a homological version of Quillen's Theorem A in this context and introduce the notion of cellular categories. Second, we…

Algebraic Topology · Mathematics 2021-07-14 Michał Lipiński , David Mosquera-Lois , Mateusz Przybylski

Tangle-tree theorems are an important tool in structural graph theory, and abstract separation systems are a very general setting in which tangle-tree theorems can still be formulated and proven. For infinite abstract separation systems, so…

Combinatorics · Mathematics 2023-09-14 Ann-Kathrin Elm , Hendrik Heine

Generic absoluteness is the phenomenon that certain truths in the set-theoretic universe remain stable under forcing expansions. A classical result by Kripke asserts that every complete Boolean algebra completely embeds into a countably…

Logic · Mathematics 2026-05-08 Cesare Straffelini

We use topological ideas to show that, assuming the conjecture of Erd\"(o)s on subsets of positive integers having no $p$ terms in arithmetic progression (A. P.), there must exist a subset $M_p$ of positive integers with no $p$ terms in A.…

Number Theory · Mathematics 2007-05-23 Goutam Pal

We study the multiplicative convolution for c-monotone independence. This convolution unifies the monotone, Boolean and orthogonal multiplicative convolutions. We characterize convolution semigroups for the c-monotone multiplicative…

Operator Algebras · Mathematics 2013-12-04 Takahiro Hasebe

It is known that there are infinitely-many prime numbers which take the form of a polynomial of degree one with integer coefficients, this is Dirichlet's theorem. We use an elementary sieving argument together with bounds on the prime…

Number Theory · Mathematics 2017-07-24 Acquaah Peter

We introduce the notion of strong $p$-semi-regularity and show that if $p$ is a regular type which is not locally modular then any $p$-semi-regular type is strongly $p$-semi-regular. Moreover, for any such $p$-semi-regular type, "domination…

Logic · Mathematics 2024-04-16 Elisabeth Bouscaren , Bradd Hart , Ehud Hrushovski , Michael C. Laskowski

Consider the expansion $T_S$ of a theory $T$ by a predicate for a submodel of a reduct $T_0$ of $T$. We present a setup in which this expansion admits a model companion $TS$. We show that the nice features of the theory $T$ transfer to…

Logic · Mathematics 2019-11-01 Christian d'Elbée

We prove the consistency of $\mathrm{add}(\mathcal{N})<\mathrm{cov}(\mathcal{N})<\mathfrak{p}=\mathfrak{g}=\mathfrak{s}<\mathrm{add}(\mathcal{M})=\mathrm{cof}(\mathcal{M})<\mathfrak{a}=\mathrm{non}(\mathcal{N})=\mathfrak{c}$ with ZFC where…

Logic · Mathematics 2019-08-15 Vera Fischer , Diego A. Mejía

These are the lecture notes based on earlier papers with some additional new results. New and simple proofs are given for local freeness theorem and the semipositivity theorem. A decomposition theorem for higher direct images of dualizing…

Algebraic Geometry · Mathematics 2013-10-15 Yujiro Kawamata

In the theory of algebraic function fields and their applications to the information theory, the Riemann-Roch theorem plays a fundamental role. But its use, delicate in general, is efficient and practical for applications especially in the…

Algebraic Geometry · Mathematics 2026-02-17 S Ballet , M Koutchoukali

We shall consider nonrestricted representations of $C_l-$ type Lie algebra over an algebraically closed field of characteristic $p\geq7.$ This paper gives some counter examples to important theory relating to the representations of modular…

Representation Theory · Mathematics 2022-03-01 YangGon Kim

This work is motivated by a question at the heart of unsupervised learning approaches: Assume we are collecting a number K of (subjective) opinions about some event E from K different agents. Can we infer E from them? Prima facie this seems…

Information Theory · Computer Science 2018-05-15 Janis Nötzel , Walter Swetly

A famous conjecture about group algebras of torsion-free groups states that there is no zero divisor in such group algebras. A recent approach to settle the conjecture is to show the non-existence of zero divisors with respect to the length…

Group Theory · Mathematics 2023-05-19 Alireza Abdollahi , Zahra Taheri

The class of selfdecomposable distributions in free probability theory was introduced by Barndorff-Nielsen and the third named author. It constitutes a fairly large subclass of the freely infinitely divisible distributions, but so far…

Probability · Mathematics 2017-07-21 Takahiro Hasebe , Noriyoshi Sakuma , Steen Thorbjørnsen

A classic result due to Bernstein states that in set theory with classical logic, but without the axiom of choice, for all sets $X$ and $Y$, if $X \times 2 \cong Y \times 2$ then also $X \cong Y$. We show that this cannot be done in…

Logic · Mathematics 2018-04-13 Andrew Swan

The preservation theorems for semi-properness, hemi-properness, and pseudo-completeness hold for countable support iterations as well as revised countable support iterations, notwithstanding the fact that the "factor lemma" fails for the…

Logic · Mathematics 2009-09-25 Chaz Schlindwein
‹ Prev 1 4 5 6 7 8 10 Next ›