total 81050took 0.11s

Forbidden subposet problems with size restrictionsAug 23 2016Upper bounds to the size of a family of subsets of an n-element set that avoids certain configurations are proved. These forbidden configurations can be described by inclusion patterns and some sets having the same size. Our results are closely related ... More

The method of double chains for largest families with excluded subposetsApr 24 2012For a given finite poset $P$, $La(n,P)$ denotes the largest size of a family $\mathcal{F}$ of subsets of $[n]$ not containing $P$ as a weak subposet. We exactly determine $La(n,P)$ for infinitely many $P$ posets. These posets are built from seven base ... More

Squares and their centersAug 05 2014Aug 24 2014We study the relationship between the sizes of two sets $B, S\subset\mathbb{R}^2$ when $B$ contains either the whole boundary, or the four vertices, of a square with axes-parallel sides and center in every point of $S$, where size refers to one of cardinality, ... More

Triangle areas determined by arrangements of planar linesFeb 08 2019A widely investigated subject in combinatorial geometry, originated from Erd\H{o}s, is the following. Given a point set $P$ of cardinality $n$ in the plane, how can we describe the distribution of the determined distances? This has been generalized in ... More

Orientations of graphs with uncountable chromatic numberAug 24 2016Nov 09 2017Motivated by an old conjecture of P. Erd\H{o}s and V. Neumann-Lara, our aim is to investigate digraphs with uncountable dichromatic number and orientations of undirected graphs with uncountable chromatic number. A graph has uncountable chromatic number ... More

Density of 4-edge paths in graphs with fixed edge densityJan 06 2016We investigate the number of 4-edge paths in graphs with a fixed number of vertices and edges. An asymptotically sharp upper bound is given to this quantity. The extremal construction is the quasi-star or the quasi-clique graph, depending on the edge ... More

Micro-Faraday cup matrix detector for ion beam measurements in fusion plasmasMar 06 2019Atomic Beam Probe (ABP) is an extension of the routinely used Beam Emission Spectroscopy (BES) diagnostic for plasma edge current fluctuation measurement at magnetically confined plasmas. Beam atoms ionized by the plasma are directed to a curved trajectory ... More

Finsler spaces with infinite dimensional holonomy groupDec 02 2010Our paper is devoted to the study of the holonomy groups of Finsler surfaces using the methods of infinite dimensional Lie theory. The notion of infinitesimal holonomy algebra will be introduced, by the smallest Lie algebra of vector fields on an indicatrix, ... More

Characterization of projectively flat Finsler manifolds of constant curvature with finite dimensional holonomy groupApr 05 2013Apr 12 2013In this paper we prove that the holonomy group of a simply connected locally projectively flat Finsler manifold of constant curvature is a finite dimensional Lie group if and only if it is flat or it is Riemannian.

t-wise Berge and t-heavy hypergraphsFeb 08 2019In many proofs concerning extremal parameters of Berge hypergraphs one starts with analyzing that part of that shadow graph which is contained in many hyperedges. Capturing this phenomenon we introduce two new types of hypergraphs. A hypergraph $\mathcal{H}$ ... More

On the maximum number of copies of H in graphs with given size and orderOct 01 2018We study the maximum number $ex(n,e,H)$ of copies of a graph $H$ in graphs with given number of vertices and edges. We show that for any fixed graph $H$, $ex(n,e,H)$ is asymptotically realized by the quasi-clique provided that the edge density is sufficiently ... More

Incomparable copies of a poset in the Boolean latticeSep 27 2013Let $B_n$ be the poset generated by the subsets of $[n]$ with the inclusion as relation and let $P$ be a finite poset. We want to embed $P$ into $B_n$ as many times as possible such that the subsets in different copies are incomparable. The maximum number ... More

Union-intersecting set systemsMar 01 2014Three intersection theorems are proved. First, we determine the size of the largest set system, where the system of the pairwise unions is l-intersecting. Then we investigate set systems where the union of any s sets intersect the union of any t sets. ... More

Jointly convex quantum Jensen divergencesDec 14 2017Mar 08 2018We investigate the quantum Jensen divergences from the viewpoint of joint convexity. It turns out that the set of the functions which generate jointly convex quantum Jensen divergences on positive matrices coincides with the Matrix Entropy Class which ... More

On a problem of Bauschke and BorweinDec 05 2014Aug 03 2015Consider a differentiable convex function $f: \mathbb{R}^n \supset \mathrm{dom} f \rightarrow \mathbb{R}.$ The induced spectral function $F$ is given by $F=f \circ \lambda,$ where $\lambda: \mathbf{M}_n^{sa} \rightarrow \mathbb{R}^{n}$ is the eigenvalue ... More

An overview of radial pulsations of relativistic stellar models for dissipative fluidsApr 01 2019In this paper we present a review of radial oscillations of neutron stars which complements earlier studies. We consider oscillations that are damped by the presence of viscosity and thermal conductivity in the nuclear matter which directly determine ... More

Forbidding rank-preserving copies of a posetOct 25 2017The maximum size, $La(n,P)$, of a family of subsets of $[n]=\{1,2,...,n\}$ without containing a copy of $P$ as a subposet, has been intensively studied. Let $P$ be a graded poset. We say that a family $\mathcal{F}$ of subsets of $[n]=\{1,2,...,n\}$ contains ... More

On the number of containments in $P$-free familiesApr 04 2018A subfamily $\{F_1,F_2,\dots,F_{|P|}\}\subseteq \mathcal F$ is a copy of the poset $P$ if there exists a bijection $i:P\rightarrow \{F_1,F_2,\dots,F_{|P|}\}$ such that $p\le_P q$ implies $i(p)\subseteq i(q)$. A family $\mathcal F$ is $P$-free, if it does ... More

Vertex Turán problems for the oriented hypercubeJul 18 2018In this short note we consider the oriented vertex Tur\'an problem in the hypercube: for a fixed oriented graph $\overrightarrow{F}$, determine the maximum size $ex_v(\overrightarrow{F}, \overrightarrow{Q_n})$ of a subset $U$ of the vertices of the oriented ... More

On the joint convexity of the Bregman divergence of matricesMay 30 2014Apr 23 2015We characterize the functions for which the corresponding Bregman divergence is jointly convex on matrices. As an application of this characterization, we derive a sharp inequality for the quantum Tsallis entropy of a tripartite state, which can be considered ... More

Chordal Editing is Fixed-Parameter TractableMay 30 2014Graph modification problems are typically asked as follows: is there a small set of operations that transforms a given graph to have a certain property. The most commonly considered operations include vertex deletion, edge deletion, and edge addition; ... More

Adaptive Majority Problems for Restricted Query Graphs and for Weighted SetsMar 20 2019Suppose that the vertices of a graph $G$ are colored with two colors in an unknown way. The color that occurs on more than half of the vertices is called the majority color (if it exists), and any vertex of this color is called a majority vertex. We study ... More

A faster FPT algorithm for Bipartite ContractionMay 13 2013Sep 04 2013The \textsc{Bipartite Contraction} problem is to decide, given a graph $G$ and a parameter $k$, whether we can can obtain a bipartite graph from $G$ by at most $k$ edge contractions. The fixed-parameter tractability of the problem was shown by [Heggernes ... More

Quantum Hellinger distances revisitedMar 25 2019This short note aims to study quantum Hellinger distances introduced recently by Bhatia et al. [Lett. Math. Phys. (2019), in press, arXiv:1901.01378] with a particular emphasis on barycenters. We consider a quite large family of generalized quantum Hellinger ... More

Interval Deletion is Fixed-Parameter TractableNov 26 2012May 06 2014We study the minimum \emph{interval deletion} problem, which asks for the removal of a set of at most $k$ vertices to make a graph of $n$ vertices into an interval graph. We present a parameterized algorithm of runtime $10^k \cdot n^{O(1)}$ for this problem, ... More

Triangle-different Hamiltonian pathsAug 18 2016Oct 11 2016Let $G$ be a fixed graph. Two paths of length $n-1$ on $n$ vertices (Hamiltonian paths) are $G$-different if there is a subgraph isomorphic to $G$ in their union. In this paper we prove that the maximal number of pairwise triangle-different Hamiltonian ... More

Quantum Hellinger distances revisitedMar 25 2019Apr 19 2019This short note aims to study quantum Hellinger distances investigated recently by Bhatia et al. [Lett. Math. Phys. (2019), in press, arXiv:1901.01378] with a particular emphasis on barycenters. We introduce the family of generalized quantum Hellinger ... More

On Congruence Permutable $G$-setsJan 14 2018Feb 24 2018An algebraic structure is said to be congruence permutable if its arbitrary congruences $\alpha$ and $\beta$ satisfy the equation $\alpha \circ \beta =\beta \circ \alpha$, where $\circ$ denotes the usual composition of binary relations. For an arbitrary ... More

Separators of Ideals in Multiplicative Semigroups of Unique Factorization DomainsAug 29 2015In this paper we show that if $I$ is an ideal of a commutative semigroup $C$ such that the separator $SepI$ of $I$ is not empty then the factor semigroup $S=C/P_I$ ($P_I$ is the principal congruence on $C$ defined by $I$) satisfies Condition $(*)$: $S$ ... More

Low complexity Haar null sets without G_δ hulls in Z^ωOct 21 2016Mar 25 2018We show that for every $2\le \xi<\omega_1$ there exists a Haar null set in $\mathbb{Z}^\omega$ that is the difference of two $\mathbf{\Pi}^0_\xi$ sets but not contained in any $\mathbf{\Pi}^0_\xi$ Haar null set. In particular, there exists a Haar null ... More

Stability results on vertex Turán problems in Kneser graphsApr 11 2018Apr 20 2018The vertex set of the Kneser graph $K(n,k)$ is $V = \binom{[n]}{k}$ and two vertices are adjacent if the corresponding sets are disjoint. For any graph $F$, the largest size of a vertex set $U \subseteq V$ such that $K(n,k)[U]$ is $F$-free, was recently ... More

Stability results on vertex Turán problems in Kneser graphsApr 11 2018Mar 07 2019The vertex set of the Kneser graph $K(n,k)$ is $V = \binom{[n]}{k}$ and two vertices are adjacent if the corresponding sets are disjoint. For any graph $F$, the largest size of a vertex set $U \subseteq V$ such that $K(n,k)[U]$ is $F$-free, was recently ... More

Left equalizer simple semigroupsApr 27 2015Sep 29 2015In this paper we characterize and construct semigroups whose right regular representation is a left cancellative semigroup. These semigroups will be called left equalizer simple semigroups. For a congruence $\varrho$ on a semigroup $S$, let ${\mathbb ... More

Trees, ladders and graphsSep 09 2014We introduce a new method to construct uncountably chromatic graphs from non special trees and ladder systems. Answering a question of P. Erd\H{o}s and A. Hajnal from 1985, we construct graphs of chromatic number $\omega_1$ without uncountable $\omega$-connected ... More

Uncountable strongly surjective linear ordersJun 30 2017Jan 30 2018A linear order $L$ is strongly surjective if $L$ can be mapped onto any of its suborders in an order preserving way. We prove various results on the existence and non-existence of uncountable strongly surjective linear orders answering questions of Camerlo, ... More

Two infinite quantities and their surprising relationshipMar 12 2018As early as the 17th century, Galileo Galilei wondered how to compare the sizes of infinite sets. Fast forward almost four hundred years, and in the summer of 2017, at the 6th European Set Theory Conference, a young model theorist, Maryanthe Malliaris, ... More

A model with Suslin trees but no minimal uncountable linear orders other than $ω_1$ and $-ω_1$Mar 09 2018Mar 12 2018We show that the existence of a Suslin tree does not necessarily imply that there are uncountable minimal linear orders other than $\omega_1$ and $-\omega_1$, answering a question of J. Baumgartner. This is done by a Jensen-type iteration, proving that ... More

Orientations of graphs with uncountable chromatic numberAug 24 2016A graph (digraph) has uncountable chromatic number if its vertices cannot be covered by countably many independent (acyclic) sets. Our aim is to investigate digraphs with uncountable chromatic number and orientations of undirected graphs with uncountable ... More

Ladder system uniformization on trees I & IIJun 11 2018Jan 04 2019Given a tree $T$ of height $\omega_1$, we say that a ladder system colouring $(f_\alpha)_{\alpha\in \lim\omega_1}$ has a $T$-uniformization if there is a function $\varphi$ defined on a subtree $S$ of $T$ so that for any $s\in S_\alpha$ of limit height ... More

On the Mass Function, Multiplicity, and Origins of Wide-Orbit Giant PlanetsApr 12 2019Apr 16 2019A major outstanding question regarding the formation of planetary systems is whether wide-orbit giant planets form differently than close-in giant planets. We aim to establish constraints on two key parameters that are relevant for understanding the formation ... More

Generalized conic functions of hv-convex planar sets: continuity properties and relations to X-raysMar 14 2013Dec 20 2013In the paper we investigate the continuity properties of the mapping $\Phi$ which sends any non-empty compact connected hv-convex planar set $K$ to the associated generalized conic function $f_K$. The function $f_K$ measures the average taxicab distance ... More

Rheology of dense granular flows for elongated particlesOct 18 2017We study the rheology of dense granular flows for frictionless spherocylinders by means of 3D numerical simulations. As in the case of spherical particles, the effective friction $\mu$ is an increasing function of the inertial number $I$, and we systematically ... More

Topological Analysis of Bitcoin's Lightning NetworkJan 15 2019Apr 14 2019Bitcoin's Lightning Network (LN) is a scalability solution for Bitcoin allowing transactions to be issued with negligible fees and settled instantly at scale. In order to use LN, funds need to be locked in payment channels on the Bitcoin blockchain (Layer-1) ... More

Direct construction of code loopsNov 14 2004Dec 14 2004Code loops were introduced by R. L. Griess. R.L. Griess and T. Hsu gave methods to construct the corresponding code loop from any given doubly even binary code; both these methods used some kind of induction. In this paper, we present a global construction ... More

On the number of k-dominating independent setsApr 13 2015May 07 2015We study the existence and the number of $k$-dominating independent sets in certain graph families. While the case $k=1$ namely the case of maximal independent sets - which is originated from Erd\H{o}s and Moser - is widely investigated, much less is ... More

The Abel map for surface singularities III. Elliptic germsFeb 20 2019If $(\widetilde{X},E)\to (X,o)$ is the resolution of a complex normal surface singularity and $c_1:{\rm Pic}(\widetilde{X})\to H^2(\widetilde{X},{\mathbb Z})$ is the Chern class map, then ${\rm Pic}^{l'}(\widetilde{X}):= c_1^{-1}(l')$ has a (Brill--Noether ... More

Rainbow Ramsey problems for the Boolean latticeSep 23 2018We address the following rainbow Ramsey problem: For posets $P,Q$ what is the smallest number $n$ such that any coloring of the elements of the Boolean lattice $B_n$ either admits a monochromatic copy of $P$ or a rainbow copy of $Q$. We consider both ... More

Some notes on $L^{p}$ Bernstein inequality when $0<p<1$Aug 29 2014Recently, Nagy-To\'okos and Totik-Varga proved an asymptotically sharp $L^{p}$ Bernstein type inequality on union of finitely many intervals. We extend this inequality to the case when the power $p$ is between $0$ and $1$; such sharp Bernstein type inequality ... More

Computing discrete logarithm by interval-valued paradigmApr 01 2014Interval-valued computing is a relatively new computing paradigm. It uses finitely many interval segments over the unit interval in a computation as data structure. The satisfiability of Quantified Boolean formulae and other hard problems, like integer ... More

Phase transition in a double branching annihilating random walkMay 27 2016This paper investigates the long-time behavior of double branching annihilating random walkers with nearest-neighbor dependent rates. The system consists of even number of particles which can execute nearest-neighbor random walk and they can as well give ... More

On the topology of elliptic singularitiesJan 18 2019For any elliptic normal surface singularity with rational homology sphere link we consider a new elliptic sequence, which differs from the one introduced by Laufer and S. S.-T. Yau. However, we show that their length coincide. Using the properties of ... More

Topological Analysis of Bitcoin's Lightning NetworkJan 15 2019Jan 16 2019Bitcoin's Lightning Network (LN) is a scalability solution for Bitcoin allowing transactions to be issued with negligible fees and settled instantly at scale. In order to use LN, funds need to be locked in payment channels on the Bitcoin blockchain (Layer-1) ... More

A discrete isodiametric result: the Erdős-Ko-Rado theorem for multisetsDec 05 2012Mar 09 2014There are many generalizations of the Erd\H{o}s-Ko-Rado theorem. We give new results (and problems) concerning families of $t$-intersecting $k$-element multisets of an $n$-set and point out connections to coding theory and classical geometry. We establish ... More

Construction of the Bethe State for the $E_{τ,η}(so_3)$ Elliptic Quantum GroupDec 04 2006Jan 05 2007Elliptic quantum groups can be associated to solutions of the star-triangle relation of statistical mechanics. In this paper, we consider the particular case of the $E_{\tau,\eta}(so_3)$ elliptic quantum group. In the context of algebraic Bethe ansatz, ... More

Connexions with totally skew-symmetric torsion and nearly-Kaehler geometrySep 08 2007We study almost Hermitian structures admitting a Hermitian connexion with totally skew-symmetric torsion or equivalently, those almost Hermitian structures with totally skew-symmetric Nijenhuis tensor. We investigate up to what extent the Nijenhuis tensor ... More

Prolongations of Lie algebras and applicationsDec 10 2007Jun 05 2008We study the skew-symmetric prolongation of a Lie subalgebra $\g \subseteq \mathfrak{so}(n)$, in other words the intersection $\Lambda^3 \cap (\Lambda^1 \otimes \g)$.We compute this space in full generality. Applications include uniqueness results for ... More

A driven-dissipative quantum Monte Carlo method for open quantum systemsFeb 16 2018We develop a real-time Full Configuration Interaction Quantum Monte Carlo approach for the modeling of driven-dissipative open quantum systems. The method enables stochastic sampling of the Liouville-von-Neumann time evolution of the density matrix, thanks ... More

Haar null and Haar meager sets: a survey and new resultsJun 21 2016Aug 25 2018We survey results about Haar null subsets of (not necessarily locally compact) Polish groups. The aim of this paper is to collect the fundamental properties of the various possible definitions of Haar null sets, and also to review the techniques that ... More

Infinite combinatorics plain and simpleMay 17 2017Feb 05 2018We explore a general method based on trees of elementary submodels in order to present highly simplified proofs to numerous results in infinite combinatorics. While countable elementary submodels have been employed in such settings already, we significantly ... More

How to initialize a second class particle?Oct 16 2015Feb 06 2017We identify the ballistically and diffusively rescaled limit distribution of the second class particle position in a wide range of asymmetric and symmetric interacting particle systems with established hydrodynamic behavior, respectively (including zero-range, ... More

Efficiency analysis of simple perturbed pairwise comparison matricesMay 26 2015May 11 2016Efficiency, the basic concept of multi-objective optimization is investigated for the class of pairwise comparison matrices. A weight vector is called efficient if no alternative weight vector exists such that every pairwise ratio of the latter's components ... More

(Re)constructing code loopsMar 07 2019The Parker loop is a central extension of the extended binary Golay code. It is an example of a general class of non-associative structures known as \emph{code loops}, which have been studied from a number of different algebraic and combinatorial perspectives. ... More

On nonpermutational transformation semigroups with an application to syntactic complexityFeb 28 2014We give an upper bound of $n((n-1)!-(n-3)!)$ for the possible largest size of a subsemigroup of the full transformational semigroup over $n$ elements consisting only of nonpermutational transformations. As an application we gain the same upper bound for ... More

On the structure and syntactic complexity of generalized definite languagesApr 21 2013We give a forbidden pattern characterization for the class of generalized definite languages, show that the corresponding problem is NL-complete and can be solved in quadratic time. We also show that their syntactic complexity coincides with that of the ... More

3-nets realizing a diassociative loop in a projective planeMar 01 2016A \textit{$3$-net} of order $n$ is a finite incidence structure consisting of points and three pairwise disjoint classes of lines, each of size $n$, such that every point incident with two lines from distinct classes is incident with exactly one line ... More

Hitting forbidden subgraphs in graphs of bounded treewidthNov 15 2014We study the complexity of a generic hitting problem H-Subgraph Hitting, where given a fixed pattern graph $H$ and an input graph $G$, the task is to find a set $X \subseteq V(G)$ of minimum size that hits all subgraphs of $G$ isomorphic to $H$. In the ... More

Hermitian codes from higher degree placesJun 20 2012Matthews and Michel investigated the minimum distances in certain algebraic-geometry codes arising from a higher degree place $P$. In terms of the Weierstrass gap sequence at $P$, they proved a bound that gives an improvement on the designed minimum distance. ... More

Spectral Symmetry in II_1 FactorsAug 20 2004Sep 06 2004A self-adjoint element in a finite AW*-factor is spectrally symmetric, if its spectral measure under the quasitrace is invariant under the change of variables $t\longmapsto -t$. We show that if $\mathcal{A}$ is an AW*-factor of type II_1, a self-djoint ... More

Robust regression for mixed Poisson-Gaussian modelNov 23 2016May 17 2017This paper focuses on efficient computational approaches to compute approximate solutions of a linear inverse problem that is contaminated with mixed Poisson--Gaussian noise, and when there are additional outliers in the measured data. The Poisson--Gaussian ... More

Schreier decomposition of loopsMay 13 2015The aims of this paper are to find algebraic characterizations of Schreier loops and explore the limits of the non-associative generalization of the theory of Schreier extensions. A loop can have Schreier decomposition with respect to a normal subgroup ... More

Cross-Sperner familiesApr 20 2011A pair of families $(\cF,\cG)$ is said to be \emph{cross-Sperner} if there exists no pair of sets $F \in \cF, G \in \cG$ with $F \subseteq G$ or $G \subseteq F$. There are two ways to measure the size of the pair $(\cF,\cG)$: with the sum $|\cF|+|\cG|$ ... More

Multi-budgeted directed cutsOct 16 2018We study multi-budgeted variants of the classic minimum cut problem and graph separation problems that turned out to be important in parameterized complexity: Skew Multicut and Directed Feedback Arc Set. In our generalization, we assign colors $1,2,...,\ell$ ... More

Nuclear properties of loop extensionsMay 13 2015Feb 15 2019The objectives of this paper is to give a systematic investigation of extension theory of loops. A loop extension is (left, right or middle) nuclear, if the kernel of the extension consists of elements associating (from left, right or middle) with all ... More

Testing and improving shear viscous phase space correction modelsJul 04 2017Comparison of hydrodynamic calculations with experimental data inevitably requires a model for converting the fluid to particles. In this work, nonlinear $2\to 2$ kinetic theory is used to assess the overall accuracy of various shear viscous fluid-to-particle ... More

Patterns, transitions and the role of leaders in the collective dynamics of a simple robotic flockFeb 03 2012We have developed an experimental setup of very simple self-propelled robots to observe collective motion emerging as a result of inelastic collisions only. A circular pool and commercial RC boats were the basis of our first setup, where we demonstrated ... More

Biclique coverings, rectifier networks and the cost of $\varepsilon$-removalMay 30 2014We relate two complexity notions of bipartite graphs: the minimal weight biclique covering number $\mathrm{Cov}(G)$ and the minimal rectifier network size $\mathrm{Rect}(G)$ of a bipartite graph $G$. We show that there exist graphs with $\mathrm{Cov}(G)\geq ... More

Light curve and spectral evolution of the Type IIb SN 2011fuJan 28 2013We present the low-resolution spectroscopic and UBVRI broad-band photometric investigations of the Type IIb supernova 2011fu, discovered in UGC 01626. The photometric follow-up of this event has been initiated a few days after the explosion and covers ... More

Gauss-Newton Optimization for Phase Recovery from the BispectrumDec 12 2018Phase recovery from the bispectrum is a central problem in speckle interferometry which can be posed as an optimization problem minimizing a weighted nonlinear least-squares objective function. We look at two separate formulations of the phase recovery ... More

Ab initio study of the beta$-tin->Imma->sh phase transitions in silicon and germaniumAug 15 2003Jan 22 2004We have investigated the structural sequence of the high-pressure phases of silicon and germanium. We have focussed on the cd->beta-tin->Imma->sh phase transitions. We have used the plane-wave pseudopotential approach to the density-functional theory ... More

The Turán number of blow-ups of treesApr 15 2019A conjecture of Erd\H{o}s from 1967 asserts that any graph on $n$ vertices which does not contain a fixed $r$-degenerate bipartite graph $F$ has at most $Cn^{2-1/r}$ edges, where $C$ is a constant depending only on $F$. We show that this bound holds for ... More

Bernstein- and Markov-type inequalities for rational functionsOct 21 2016Asymptotically sharp Bernstein- and Markov-type inequalities are established for rational functions on $C^2$ smooth Jordan curves and arcs. The results are formulated in terms of the normal derivatives of certain Green's functions with poles at the poles ... More

A potential theoretic minimax problem on the torusDec 30 2015Aug 15 2017We investigate an extension of an equilibrium-type result, conjectured by Ambrus, Ball and Erd\'elyi, and proved recently by Hardin, Kendall and Saff. These results were formulated on the torus, hence we also work on the torus, but one of the main motivations ... More

Finsler manifolds with non-Riemannian holonomyApr 02 2009Jan 15 2010The aim of this paper is to show that holonomy properties of Finsler manifolds can be very different from those of Riemannian manifolds. We prove that the holonomy group of a positive definite non-Riemannian Finsler manifold of non-zero constant curvature ... More

Tangent Lie algebras to the holonomy group of a Finsler manifoldDec 01 2012Our goal in this paper is to make an attempt to find the largest Lie algebra of vector fields on the indicatrix such that all its elements are tangent to the holonomy group of a Finsler manifold. First, we introduce the notion of the curvature algebra, ... More

Projectively flat Finsler manifolds with infinite dimensional holonomyFeb 05 2012Recently, we developed a method for the study of holonomy properties of non-Riemannian Finsler manifolds and obtained that the holonomy group can not be a compact Lie group, if the Finsler manifold of dimension $> 2$ has non-zero constant flag curvature. ... More

Coverings: variations on a result of Rogers and on the Epsilon-net theorem of Haussler and WelzlJul 11 2016Mar 08 2017We consider four problems. Rogers proved that for any convex body $K$, we can cover ${\mathbb R}^d$ by translates of $K$ of density very roughly $d\ln d$. First, we extend this result by showing that, if we are given a family of positive homothets of ... More

A generalized Cuntz-Krieger uniqueness theorem for higher rank graphsJul 02 2013We present a uniqueness theorem for k-graph C*-algebras that requires neither an aperiodicity nor a gauge invariance assumption. Specifically, we prove that for the injectivity of a representation of a k-graph C*-algebra, it is sufficient that the representation ... More

Data depth and floating bodySep 28 2018Little known relations of the renown concept of the halfspace depth for multivariate data with notions from convex and affine geometry are discussed. Halfspace depth may be regarded as a measure of symmetry for random vectors. As such, the depth stands ... More

Quantum symmetry algebras of spin systems related to Temperley-Lieb R-matricesDec 19 2007Jan 29 2008A reducible representation of the Temperley-Lieb algebra is constructed on the tensor product of n-dimensional spaces. One obtains as a centraliser of this action a quantum algebra (a quasi-triangular Hopf algebra) U_q with a representation ring equivalent ... More

The mass of spacelike hypersurfaces in asymptotically anti-de Sitter space-timesOct 02 2001Jan 18 2002We give a Hamiltonian definition of mass for spacelike hypersurfaces in space-times with metrics which are asymptotic to the anti-de Sitter one, or to a class of generalizations thereof. We show that our definition provides a geometric invariant for a ... More

Multi-boson correlations using wave-packets IISep 24 2007We investigate the analytically solvable pion-laser model, and its generalization to arbitrary multiplicity distributions. Although this kind of extension of the model is possible, the pion laser model in its original form is unique: it is the only model ... More

Finsler 2-manifolds whose holonomy group is the diffeomorphism group of the circleOct 25 2012In this paper we show that the topological closure of the holonomy group of a certain class of projectively flat Finsler 2-manifolds of constant curvature is maximal, that is isomorphic to the connected component of the diffeomorphism group of the circle. ... More

Simple solutions of fireball hydrodynamics for rotating and expanding triaxial ellipsoids and final state observablesJun 29 2016We present a class of analytic solutions of non-relativistic fireball hydrodynamics for a fairly general class of equation of state. The presented solution describes the expansion of a triaxial ellipsoid that rotates around one of the principal axes. ... More

Simple solutions of fireball hydrodynamics for rotating and expanding triaxial ellipsoids and final state observablesJun 29 2016Nov 16 2016We present a class of analytic solutions of non-relativistic fireball hydrodynamics for a fairly general class of equation of state. The presented solution describes the expansion of a triaxial ellipsoid that rotates around one of the principal axes. ... More

The mass of asymptotically anti-de Sitter space-timesNov 29 2000Oct 04 2001We give a definition of mass for spacelike hypersurfaces in space-times with metrics which are asymptotic to the anti-de Sitter one, or to a class of generalizations thereof. We present the results of gr-qc/0110014 which show that our definition provides ... More

A new family of exact and rotating solutions of fireball hydrodynamicsSep 17 2013Mar 21 2014A new class of analytic, exact, rotating, self-similar and surprisingly simple solutions of non-relativistic hydrodynamics are presented for a three-dimensionally expanding, spheroidally symmetric fireball. These results generalize earlier, non-rotating ... More

Simple solutions of fireball hydrodynamics for rotating and expanding triaxial ellipsoids and final state observablesJun 29 2016Jan 31 2017We present a class of analytic solutions of non-relativistic fireball hydrodynamics for a fairly general class of equation of state. The presented solution describes the expansion of a triaxial ellipsoid that rotates around one of the principal axes. ... More

Bruck decomposition for endomorphisms of quasigroupsFeb 06 2009Apr 30 2009In the year 1944 R. H. Bruck has described a very general construction method which he called the extension of a set by a quasigroup. We use it to construct a class of examples for LF-quasigroups in which the image of the map $e(x)=x\backslash x$ is a ... More

An analytic hydrodynamical model of rotating 3D expansion in heavy-ion collisionsDec 02 2015A new exact and analytic solution of non-relativistic fireball hydrodynamics is presented. It describes an expanding triaxial ellipsoid that rotates around one of its principal axes. The observables are calculated using simple analytic formulas. Azimuthal ... More

HIJING++, a Heavy Ion Jet INteraction Generator for the High-luminosity Era of the LHC and BeyondNov 06 2018HIJING++ (Heavy Ion Jet INteraction Generator) is the successor of the widely used original HIJING, developed almost three decades ago. While the old versions (1.x and 2.x) were written in FORTRAN, HIJING++ was completely rewritten in C++. During the ... More