Related papers: Conditions for matchability in groups and field ex…
We give a survey of recent results related to the problem of characterizing finite-dimensional division algebras by the set of isomorphism classes of their maximal subfields. We also discuss various generalizations of this problem and some…
By a theorem of Chevalley the image of a morphism of varieties is a constructible set. The algebraic version of this fact is usually stated as a result on "extension of specializations" or "lifting of prime ideals". We present a difference…
Menger's basis property is a generalization of $\sigma$-compactness and admits an elegant combinatorial interpretation. We introduce a general combinatorial method to construct non $\sigma$-compact sets of reals with Menger's property.…
In this article I describe my recent geometric localization argument dealing with actions of NONcompact groups which provides a geometric bridge between two entirely different character formulas for reductive Lie groups and answers the…
Classical mathematics are founded within set theory, but sets don't have \emph{symmetries}. We conjecture that if we allow sets with symmetries, then many problems such as \emph{Mirror symmetry} or \emph{Homological mirror symmetry} can be…
We construct a multiset space $\mathbb{N}[X]$ over a metric space $X$ that simultaneously enjoys desirable topological properties and admits a natural matching metric $d_{\mathbb{N}[X]}$, making it a metrizable abelian topological monoid…
v2: An additional assumption was added in Theorem 4.8. In order to show that a connected abelian group is admissible on the site of locally compact spaces we must in addition assume that it is locally topologically divisible. This condition…
A notion of arithmetic similarity between number fields is defined by requiring equality of some arithmetic statistics over all but finitely many rational primes. The exceptional set is empty in all previously studied cases, but existing…
Given a hyperplane arrangement in a complex vector space of dimension n, there is a natural associated arrangement of codimension k subspaces in a complex vector space of dimension k*n. Topological invariants of the complement of this…
Given $1\le \ell <k$ and $\delta\ge0$, let $\textbf{PM}(k,\ell,\delta)$ be the decision problem for the existence of perfect matchings in $n$-vertex $k$-uniform hypergraphs with minimum $\ell$-degree at least $\delta\binom{n-\ell}{k-\ell}$.…
Motivated by the Mathieu conjecture [Ma], the image conjecture [Z3] and the well-known Jacobian conjecture [K] (see also [BCW] and [E]), the notion of Mathieu subspaces as a natural generalization of the notion of ideals has been introduced…
We introduce the concept of matching connectivity as a notion of connectivity in graph admitting perfect matchings which heavily relies on the structural properties of those matchings. We generalise a result of Robertson, Seymour and Thomas…
For a graph $G=(V,E),$ a matching $M$ is a set of independent edges. The topic of matchings is well studied in graph theory. In this paper many varieties of matchings are discussed.
We consider bipartite graphs definable in o-minimal structures, in which the edge relation $G$ is a finite union of graphs of certain measure-preserving maps. We establish a fact on the existence of definable matchings with few short…
Let K be a field of characteristic 0. We consider linear equations a1*x1+...+an*xn=1 in unknowns x1,...,xn from G, where a1,...,an are non-zero elements of K, and where G is a subgroup of the multiplicative group of non-zero elements of K.…
The relationship between two important problems in tree pattern matching, the largest common subtree and the smallest common supertree problems, is established by means of simple constructions, which allow one to obtain a largest common…
This is partly a survey and partly a research article. Some known results and open problems about Kaehler groups (fundamental groups of compact Kaehler manifolds) are discussed. A new notion of Kaehler homomorphism is introduced. This is a…
Let $A$ be a simple algebra over a field $F$. Under a mild cardinality assumption on $F$, we determine the greatest possible dimension for an $F$-affine subspace of $A$ that is included in the group of units $A^\times$, and we describe the…
A matching is compatible to two or more labeled point sets of size $n$ with labels $\{1,\dots,n\}$ if its straight-line drawing on each of these point sets is crossing-free. We study the maximum number of edges in a matching compatible to…
The identifiability problem arises naturally in a number of contexts in mathematics and computer science. Specific instances include local or global rigidity of graphs and unique completability of partially-filled tensors subject to rank…