English
Related papers

Related papers: On sets of terms having a given intersection type

200 papers

Adapting a proof of Bouscaren and Delon, we show that every type-definable connected group in a given stable theory of fields embeds into an algebraic group, under a condition on the definable closure. We also present general hypotheses…

Logic · Mathematics 2025-10-29 Charlotte Bartnick

It was proved by Mineyev and Yaman that, if $(\Gamma, \Gamma')$ is a relatively hyperbolic pair, the comparison map $$ H_b^k(\Gamma, \Gamma'; V) \to H^k(\Gamma, \Gamma'; V) $$ is surjective for every $k \ge 2$, and any bounded…

Group Theory · Mathematics 2016-11-08 Federico Franceschini

A family $\mathcal{A}$ of sets is said to be intersecting if every two sets in $\mathcal{A}$ intersect. Two families $\mathcal{A}$ and $\mathcal{B}$ are said to be cross-intersecting if each set in $\mathcal{A}$ intersects each set in…

Combinatorics · Mathematics 2017-06-20 Peter Borg

Recent work has shown that finite mixture models with $m$ components are identifiable, while making no assumptions on the mixture components, so long as one has access to groups of samples of size $2m-1$ which are known to come from the…

Statistics Theory · Mathematics 2022-07-25 Robert A. Vandermeulen , René Saitenmacher

We give necessary and sufficient conditions for the functor that forgets the $(C, \gamma)$-coaction to be separable. This leads to a generalized notion of integrals. Finally, the applications of our results are considered.

Rings and Algebras · Mathematics 2015-01-13 Shuangjian Guo , Xiaohui Zhang

We study the combinatorial equivalence of separable elements in types $A$ and $B$. A bijection is constructed from the set of separable permutations in the symmetric group $S_{n+1}$ to the set of separable signed permutations in the…

Combinatorics · Mathematics 2025-10-15 Yong Liao , Yuping Yang , Houyi Yu

Systems of equations with sets of integers as unknowns are considered. It is shown that the class of sets representable by unique solutions of equations using the operations of union and addition $S+T=\makeset{m+n}{m \in S, \: n \in T}$ and…

Formal Languages and Automata Theory · Computer Science 2013-10-28 Artur Jeż , Alexander Okhotin

We study the uniform property $\Gamma$ for separable simple $C^*$-algebras which have quasitraces and may not be exact. We show that a stably finite separable simple $C^*$-algebra $A$ with strict comparison and uniform property $\Gamma$ has…

Operator Algebras · Mathematics 2022-05-17 Huaxin Lin

In the theory of unitary group representations, a group is called type I if all factor representations are of type I, and by a celebrated theorem of James Glimm [Gli61b], the type I groups are precisely those groups for which the…

Group Theory · Mathematics 2019-04-18 Fabio Elio Tonti , Asger Törnquist

Initially announced by Dorfman in 1943, (Binomial) Group Testing (BGT) was quickly recognized as a useful tool in many other fields as well. To apply any particular BGT procedure effectively, one first of all needs to know an important…

Methodology · Statistics 2023-04-17 Ugnė Čižikovienė , Viktor Skorniakov

Let $\Sigma$ be a closed orientable surface of genus at least two, and let $X, Y$ be distinct marked Riemann surface structures on $\Sigma$, possibly with opposite orientations. In this paper, we show that there are (exactly) countably…

Geometric Topology · Mathematics 2025-08-11 Shinpei Baba

Motivated by classical notions of partial convexity, biconvexity, and bilinear matrix inequalities, we investigate the theory of free sets that are defined by (low degree) noncommutative matrix polynomials with constrained terms. Given a…

Functional Analysis · Mathematics 2021-06-03 Michael Jury , Igor Klep , Mark E. Mancuso , Scott McCullough , James Eldred Pascoe

We investigate the intersection problem for finite semigroups, which asks for a given set of regular languages, represented by recognizing morphisms to finite semigroups, whether there exists a word contained in their intersection. We…

Formal Languages and Automata Theory · Computer Science 2018-06-14 Lukas Fleischer

This work derives an upper bound on the maximum cardinality of a family of graphs on a fixed number of vertices, in which the intersection of every two graphs in that family contains a subgraph that is isomorphic to a specified graph H.…

Combinatorics · Mathematics 2025-05-23 Igal Sason

The \emph{Separation Lemma} is a simple yet powerful tool, akin to the well-known \emph{Isolation Lemma}, that guarantees the uniqueness of certain set sums. Bandopadhyay et al.\ introduced this lemma to establish lower bounds for the \ALP…

Data Structures and Algorithms · Computer Science 2026-05-28 Abhishek Sahu

A tuple of commuting operators $(S_1,\dots,S_{n-1},P)$ for which the closed symmetrized polydisc $\Gamma_n$ is a spectral set is called a $\Gamma_n$-contraction. We show that every $\Gamma_n$-contraction admits a decomposition into a…

Functional Analysis · Mathematics 2017-09-19 Sourav Pal

Regularity, complete intersection and Gorenstein properties of a local ring can be characterized by homological conditions on the canonical homomorphism into its residue field (Serre, Avramov, Auslander). It is also known that in positive…

Commutative Algebra · Mathematics 2013-02-25 Javier Majadas

We give a new approach to intersection theory. Our "cycles" are closed manifolds mapping into compact manifolds and our "intersections" are elements of a homotopy group of a certain Thom space. The results are then applied in various…

Algebraic Topology · Mathematics 2014-11-11 John R. Klein , E. Bruce Williams

We show that for every finite colouring of the natural numbers there exists $a,b >1$ such that the triple $\{a,b,a^b\}$ is monochromatic. We go on to show the partition regularity of a much richer class of patterns involving exponentiation.…

Combinatorics · Mathematics 2016-10-24 Julian Sahasrabudhe

Purpose: This study extends the structural theory of finite commutative ternary $\Gamma$-semirings into a computational and categorical framework for explicit classification and constructive reasoning. Methods: Constraint-driven enumeration…

Rings and Algebras · Mathematics 2026-02-04 Chandrasekhar Gokavarapu , Dr D Madhusudhana Rao