Related papers: A note on transitive union-closed families

Let S be a cyclic n-ary sequence. We say that S is a {\it universal cycle} ((n,k)-Ucycle) for k-subsets of [n] if every such subset appears exactly once contiguously in S, and is a Ucycle packing if every such subset appears at most once.…

Using a new technique, we prove a rich family of special cases of the matroid intersection conjecture. Roughly, we prove the conjecture for pairs of tame matroids which have a common decomposition by 2-separations into finite parts.

Let a $R$-body be a closed set, complement of union of open balls of radius $R$ in the Euclidean space. Properties generalizing similar ones for convex sets are proved for the family of $R$-bodies; properties for the family of sets…

We have established various criteria for the topological transitivity of families of continuous (holomorphic) functions. Furthermore, by leveraging the properties of expanding families of meromorphic functions, we offer an alternative proof…

We show that the commutative closure combined with the iterated shuffle is a regularity-preserving operation on group languages. In particular, for commutative group languages, the iterated shuffle is a regularity-preserving operation. We…

A fine mixed subdivision of a (d-1)-simplex T of size n gives rise to a system of ${d \choose 2}$ permutations of [n] on the edges of T, and to a collection of n unit (d-1)-simplices inside T. Which systems of permutations and which…

We prove the Banach strong Novikov conjecture for groups having polynomially bounded higher-order combinatorial functions. This includes all automatic groups.

Mubayi's Conjecture states that if $\mathcal{F}$ is a family of $k$-sized subsets of $[n] = \{1,\ldots,n\}$ which, for $k \geq d \geq 2$, satisfies $A_1 \cap\cdots\cap A_d \neq \emptyset$ whenever $|A_1 \cup\cdots\cup A_d| \leq 2k$ for all…

Many of the conjectures of current interest in the representation theory of finite groups in characteristic $p$ are local-to-global statements, in that they predict consequences for the representations of a finite group $G$ given data about…

We identify a number of decidable and undecidable fragments of first-order concatenation theory. We also give a purely universal axiomatization which is complete for the fragments we identify. Furthermore, we prove some normal-form results.

We prove an upper bound for the number of cyclic transitive subgroups in a finite permutation group and clarify the structure of the groups for which this bound becomes sharp. We also give an application in the theory of number fields.

We consider the problem of extending an acyclic binary relation that is invariant under a given family of transformations into an invariant preference. We show that when a family of transformations is commutative, every acyclic invariant…

We prove a generalization of the Poincar\'e-Birkhoff theorem for the open annulus showing that if a homeomorphism satisfies a certain twist condition and the nonwandering set is connected, then there is a fixed point. Our main focus is the…

Let G be a transitive group of permutations of a finite set X, and suppose that some element of G has at most two orbits on X. We prove that any two maximal chains of groups between G and a point-stabilizer of G have the same length, and…

We consider a problem of maximizing the product of the sizes of two uniform cross-$t$-intersecting families of sets. We show that the value of this maximum is at most polynomially larger (in the size of a ground set) than a quantity…

We prove that for any set $F$ of $n\ge 2$ pairwise disjoint open convex sets in $\mathbb{R}^3$, the connected components of the set of lines intersecting every member of $F$ are contractible. The same result holds for directed lines.

Given a smooth, proper family of varieties in characteristic $p>0$, and a cycle $z$ on a fibre of the family, we formulate a Variational Tate Conjecture characterising, in terms of the crystalline cycle class of $z$, whether $z$ extends…

In this note, it is proved the existence of an infinitely generated multiplicative group consisting of entire functions that are, except for the constant function 1, hypercyclic with respect to the convolution operator associated to a given…

A cycle-transversal of a graph G is a subset T of V(G) such that T intersects every cycle of G. A clique cycle-transversal, or cct for short, is a cycle-transversal which is a clique. Recognizing graphs which admit a cct can be done in…

We prove the Complete nontrivial cycle-intersection theorem for systems of permutations.