Related papers: On interrelations between strongly, weakly and cho…
A particular discrete rhombohedral lattice consisting of four symmetrically interlaced cuboctahedral point lattices is described that is interesting because of the high degree of symmetry it exhibits. The four constituent cuboctahedral…
Large sets of combinatorial designs has always been a fascinating topic in design theory. These designs form a partition of the whole space into combinatorial designs with the same parameters. In particular, a large set of block designs,…
We posit that there exist deep and fundamental relationships between the above seemingly very different materials. The carrier concentration-dependences of the electronic behavior in the conducting organic charge-transfer solids and layered…
Soft materials, such as colloidal suspensions, polymer solutions, and biological systems, are typically multicomponent mixtures of macromolecules and simpler components (e.g., microions, monomers, solvent) that can assemble into complex…
Many combinatorial proofs rely on induction. When these proofs are formulated in traditional language, they can be bulky and unmanageable. Coalgebras provide a language which can reduce reduce many inductive proofs in graded poset theory to…
Strong functors and monads are ubiquitous in Computer Science. More recently, comonads have demonstrated their use in structuring context-dependent notions of computation. However, the dualisation of ``being strong'' property passed somehow…
This short survey of recent work in tile self-assembly discusses the use of simulation to classify and separate the computational and expressive power of self-assembly models. The journey begins with the result that there is a single…
The paper develops elementary linear algebra methods to compute the determinants of the tensor symmetrizations of quadratic and hermitian forms over fields of good characteristic. Explicit results are given for the partitions $(n)$,…
We study complete, simply-connected manifolds with special holonomy that are toric with respect to their multi-moment maps. We consider the cases where there is a connected non-Abelian symmetry group containing the torus. For…
From Smyth's classification, modular compactifications of pointed smooth rational curves are indexed by combinatorial data, so-called extremal assignments. We explore their combinatorial structures and show that any extremal assignment is a…
The study of sums of finite sets of integers has mostly concentrated on sets with small sumsets (Freiman's theorem and related work) and on sets with large sumsets (Sidon sets and $B_h$-sets). This paper considers the sets ${\mathcal…
If A is a finite-dimensional symmetric algebra, then it is well-known that the only silting complexes in $\mathrm{K^b}(\mathrm{proj}A)$ are the tilting complexes. In this note we investigate to what extent the same can be said for weakly…
In this paper, we investigate a class of Collatz-like problems associated with weakly and strongly admissible triplets of integers. This framework extends the classical Collatz mapping, providing a systematic method for generating triplets…
The paper addresses aggregation issues for composite (modular) solutions. A systemic view point is suggested for various aggregation problems. Several solution structures are considered: sets, set morphologies, trees, etc. Mainly, the…
We here show that the family of continuous-time linear systems (of prescribed dimensions) can be characterized through the structure of maximal, matrix-convex, cones, closed under inversion. Moreover, this observation unifies three setups:…
Compositionality is a pivotal property of symbolic reasoning. However, how well recent neural models capture compositionality remains underexplored in the symbolic reasoning tasks. This study empirically addresses this question by…
We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite…
Root systems are sets with remarkable symmetries and therefore they appear in many situations in mathematics. Among others, denominator formulae of root systems are very beautiful and mysterious equations which have several meanings from a…
S.~Elnitsky (1997) gave an elegant bijection between rhombic tilings of $2n$-gons and commutation classes of reduced words in the symmetric group on $n$ letters. P.~Magyar (1998) found an important construction of the Bott-Samelson…
This thesis contributes with a number of topics to the subject of string compactifications. In the first half of the work, I discuss the Hodge plot of Calabi-Yau threefolds realised as hypersurfaces in toric varieties. The intricate…