Related papers: For which triangles is Pick's formula almost corre…

In a graph, a perfect matching cut is an edge cut that is a perfect matching. Perfect Matching Cut (PMC) is the problem of deciding whether a given graph has a perfect matching cut, and is known to be NP-complete. We revisit the problem and…

We present a theory which predicts if the locus of a triangle center over certain Poncelet triangle families is a conic or not. We consider families interscribed in (i) the confocal pair and (ii) an outer ellipse and an inner concentric…

It has long been argued that the continuum limit of the 3D Ising model is equivalent to a string theory. Unfortunately, in the usual starting point for this equivalence -- a certain lattice theory of surfaces -- it is not at all obvious how…

Two open problems in the fixed point theory of quasi metric spaces posed in [Berinde, V. and Choban, M. M., {\it Generalized distances and their associate metrics. Impact on fixed point theory}, Creat. Math. Inform. {\bf 22} (2013), no. 1,…

After briefly describing the present status of the spin glass theory, we present a conjecture on the exact location of the multicritical point in the phase diagram of finite-dimensional spin glasses. The theory enables us to understand in a…

We use linear programming bounds to analyze point sets in the torus with respect to their optimality for problems in discrepancy theory and quasi-Monte Carlo methods. These concepts will be unified by introducing tensor product energies. We…

If a line cuts randomly two sides of a triangle, the length of the segment determined by the points of intersection is also random. The object of this study, applied to a particular case, is to calculate the probability that the length of…

We contribute to the knowledge of the quantifier completions and their applications by using the language of doctrines. This algebraic presentation allows us to properly analyse the behaviour of the existential and universal quantifiers. We…

We study the tangential case in 2-dimensional almost-Riemannian geometry. We analyse the connection with the Martinet case in sub-Riemannian geometry. We compute estimations of the exponential map which allow us to describe the conjugate…

The status of lattice calculations in Quantum Field Theory is reviewed. A major part is devoted to recent progress in formulating exact chiral symmetry on the lattice. Another topic which has received a lot of attention is the influence of…

A square trisection is a problem of assembling three identical squares from a larger square, using a minimal number of pieces. This paper presents an historical overview of the square trisection problem starting with its origins in the…

The vicinity of the critical point of the three-state Potts model on a Kagom\'e lattice is studied by mean of Random Matrix Theory. Strong evidence that the critical point is integrable is given.

Radical binomial ideals associated with finite lattices are studied. Gr\"obner basis theory turns out to be an efficient tool in this investigation.

We study an initial value problem for the Toda lattice with almost periodic initial data. We consider initial data for which the associated Jacobi operator is absolutely continuous and has a spectrum satisfying a Craig-type condition, and…

An N -tiling of triangle ABC by triangle T is a way of writing ABC as a union of N triangles congruent to T, overlapping only at their boundaries. The triangle T is the "tile'". The tile may or may not be similar to ABC . This paper is the…

Over the past few years it has been discovered that an "observable" can be set up on the lattice which obeys the discrete Cauchy-Riemann equations. The ensuing condition of discrete holomorphicity leads to a system of linear equations which…

In site percolation, vertices (sites) of a graph are open with probability p, and there is critical p, for which open vertices form an open path the long way across a graph, so a vertex at the origin is a part of an infinite connected open…

We generalize Ehrhart's idea of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an n-dimensional polytope with n+1 rational vertices, we use its description as the intersection of n+1 halfspaces,…

Have you ever taken a disputed decision by tossing a coin and checking its landing side? This ancestral "heads or tails" practice is still widely used when facing undecided alternatives since it relies on the intuitive fairness of…

The construction of discrete velocity models or numerical methods for the Boltzmann equation, may lead to the necessity of computing the collision operator as a sum over lattice points. The collision operator involves an integral over a…