相关论文: Trivial Meet and Join within the Lattice of Monoto…
Inspired by classical puzzles in geometry that ask about probabilities of geometric phenomena, we give an explicit formula for the probability that a random triangle on a flat torus is homotopically trivial. Our main tool for this…
Neutrino oscillations data indicates that neutrino mixings are consistent with an apparent $\nu_\mu - \nu_\tau$ exchange symmetry in neutrino mass matrix. We observe that in the mininimally extended standard model with the see-saw…
In the present paper a criteria for a rectangular diagram to admit a simplification is given in terms of Legendrian knots. It is shown that there are two types of simplifications which are mutually independent in a sense. A new proof of the…
We consider the problem of minimal correction of the training set to make it consistent with monotonic constraints. This problem arises during analysis of data sets via techniques that require monotone data. We show that this problem is…
We present a systematic study on minimally perturbed neutrino mass matrices which at the leading order give rise to Tri-BiMaximal (TBM) mixing due to a residual $\mathbb{Z}_2\times \mathbb{Z}_2^{\mu\tau}$ Klein symmetry in the neutrino mass…
For a real $N\ge 1$ and a vector $\xi =(1,\xi_1,...,\xi_n)$ define a matrix $$ {\cal A} (\xi, N) = ({array}{ccccc} N^{-1} & 0& 0& ... &0 \cr N^{\frac{1}{n}} \xi_1 & -N^{\frac{1}{n}} & 0&... & 0 \cr N^{\frac{1}{n}} \xi_2 &0& -N^{\frac{1}{n}}…
We report on a lattice investigation of heavy meson interactions and of tetraquark candidates with two very heavy quarks. These two quarks are treated in the static limit, while the other two are up, down, strange or charm quarks of finite…
In this article, we study the relation between lattice basis and successive minima and give an estimate for the measure-theoretical distribution of successive minima. As consequences, we also discuss some logarithm laws associated to higher…
Problems related to projections on closed convex cones are frequently encountered in optimization theory and related fields. To study these problems, various unifying ideas have been introduced, including asymmetric vector-valued norms and…
In this paper we study partitions whose successive ranks belong to a given set. We enumerate such partitions while keeping track of the number of parts, the largest part, the side of the Durfee square, and the height of the Durfee…
An analysis of extensive simulations of interacting self-avoiding polygons on cubic lattice shows that the frequencies of different knots realized in a random, collapsed polymer ring decrease as a negative power of the ranking order, and…
This paper gives a description of various recent results which construct monomial ideals with a given minimal free resolution. We show that these are all instances of coordinatizing a finite atomic lattice as defined by Mapes. Subsequently,…
A weak order on the set of maximal chains of the non-crossing partition lattice is introduced and studied. A $0$-Hecke algebra action is used to compute the radius of the graph on these chains in which two chains are adjacent if they differ…
We analyze the leptonic sector in the left-right symmetric model dressed with a $(Z_{2})^{3}$ discrete symmetry which realizes, after weak spontaneous breaking, a small broken $\mu\lra\tau$ symmetry that is suggested to explain observable…
We enumerate the number of monotonic lattice paths starting at $(0,0)$ and terminating at $(m,n)$ in which $l$ of the first $k$ steps lie below the line $y=x\ (0\leq k\leq m\leq n)$. These closed formulas consist of terms which are a…
In this paper, we characterize the congruences of an arbitrary i--lattice, investigate the structure of the lattice they form and how it relates to the structure of the lattice of lattice congruences, then, for an arbitrary non--zero…
We show that every planar graph has a monotone topological 2-page book embedding where at most (4n-10)/5 (of potentially 3n-6) edges cross the spine, and every edge crosses the spine at most once; such an edge is called a biarc. We can also…
Min-Max orderings correspond to conservative lattice polymorphisms. Digraphs with Min-Max orderings have polynomial time solvable minimum cost homomorphism problems. They can also be viewed as digraph analogues of proper interval graphs and…
The model of localized fermions on the triangular lattice is analyzed in means of the Monte Carlo simulations in the grand canonical ensemble. The Hamiltonian of the system has a form of the extended Hubbard model (at the atomic limit) with…
Consider routing traffic on the N x N torus, simultaneously between all source-destination pairs, to minimize the cost $\sum_ec(e)f^2(e)$, where f(e) is the volume of flow across edge e and the c(e) form an i.i.d. random environment. We…