More Like this

1. Curvature tensor in discrete gravity

   https://doi.org/10.1140/epjc/s10052-023-12061-1  

   Chamseddine, Ali H.; Malaeb, Ola; Najem, Sara (October 2023, The European Physical Journal C)

   Abstract We study numerically the curvature tensor in a three-dimensional discrete space. Starting from the continuous metric of a three-sphere, we transformed it into a discrete space using three integers$$n_1, n_2$$ $n_1,n_2$, and$$n_3$$ $n_3$. The numerical results are compared with the expected values in the continuous limit. We show that as the number of cells in the lattice increases, the continuous limit is recovered. 

   more » « less
2. On a Traveling Salesman Problem for Points in the Unit Cube

   https://doi.org/10.1007/s00453-024-01257-w  

   Balogh, József; Clemen, Felix Christian; Dumitrescu, Adrian (September 2024, Algorithmica)

   Abstract LetXbe ann-element point set in thek-dimensional unit cube$$[0,1]^k$$ ${[0,1]}^k$where$$k \ge 2$$ $k\ge 2$. According to an old result of Bollobás and Meir (Oper Res Lett 11:19–21, 1992) , there exists a cycle (tour)$$x_1, x_2, \ldots , x_n$$ $x_1,x_2,\dots ,x_n$through thenpoints, such that$$\left( \sum _{i=1}^n |x_i - x_{i+1}|^k \right) ^{1/k} \le c_k$$ ${\left({\sum }_{i=1}^n,{|x_i-x_{i+1}|}^k\right)}^{1/k}\le c_k$, where$$|x-y|$$ $|x-y|$is the Euclidean distance betweenxandy, and$$c_k$$ $c_k$is an absolute constant that depends only onk, where$$x_{n+1} \equiv x_1$$ $x_{n+1}\equiv x_1$. From the other direction, for every$$k \ge 2$$ $k\ge 2$and$$n \ge 2$$ $n\ge 2$, there existnpoints in$$[0,1]^k$$ ${[0,1]}^k$, such that their shortest tour satisfies$$\left( \sum _{i=1}^n |x_i - x_{i+1}|^k \right) ^{1/k} = 2^{1/k} \cdot \sqrt{k}$$ ${\left({\sum }_{i=1}^n,{|x_i-x_{i+1}|}^k\right)}^{1/k}=2^{1/k}·\sqrt{k}$. For the plane, the best constant is$$c_2=2$$ $c_2=2$and this is the only exact value known. Bollobás and Meir showed that one can take$$c_k = 9 \left( \frac{2}{3} \right) ^{1/k} \cdot \sqrt{k}$$ $c_k=9{\left(\frac{2}{3}\right)}^{1/k}·\sqrt{k}$for every$$k \ge 3$$ $k\ge 3$and conjectured that the best constant is$$c_k = 2^{1/k} \cdot \sqrt{k}$$ $c_k=2^{1/k}·\sqrt{k}$, for every$$k \ge 2$$ $k\ge 2$. Here we significantly improve the upper bound and show that one can take$$c_k = 3 \sqrt{5} \left( \frac{2}{3} \right) ^{1/k} \cdot \sqrt{k}$$ $c_k=3\sqrt{5}{\left(\frac{2}{3}\right)}^{1/k}·\sqrt{k}$or$$c_k = 2.91 \sqrt{k} \ (1+o_k(1))$$ $c_k=2.91\sqrt{k}(1+o_k\left(1\right))$. Our bounds are constructive. We also show that$$c_3 \ge 2^{7/6}$$ $c_3\ge 2^{7/6}$, which disproves the conjecture for$$k=3$$ $k=3$. Connections to matching problems, power assignment problems, related problems, including algorithms, are discussed in this context. A slightly revised version of the Bollobás–Meir conjecture is proposed. 

   more » « less
3. Restricted spaces of holomorphic sections vanishing along subvarieties

   https://doi.org/10.1007/s00209-025-03706-w  

   Coman, Dan; Marinescu, George; Nguyên, Viêt-Anh (May 2025, Mathematische Zeitschrift)

   Abstract LetXbe a compact normal complex space of dimensionnandLbe a holomorphic line bundle onX. Suppose that$$\Sigma =(\Sigma _1,\ldots ,\Sigma _\ell )$$ $\Sigma =({\Sigma }_1,\dots ,{\Sigma }_{\ell })$is an$$\ell $$ $\ell$-tuple of distinct irreducible proper analytic subsets ofX,$$\tau =(\tau _1,\ldots ,\tau _\ell )$$ $\tau =({\tau }_1,\dots ,{\tau }_{\ell })$is an$$\ell $$ $\ell$-tuple of positive real numbers, and let$$H^0_0(X,L^p)$$ $H_0^0(X,L^p)$be the space of holomorphic sections of$$L^p:=L^{\otimes p}$$ $L^p:=L^{\otimes p}$that vanish to order at least$$\tau _jp$$ ${\tau }_{j}p$along$$\Sigma _j$$ ${\Sigma }_j$,$$1\le j\le \ell $$ $1\le j\le \ell$. If$$Y\subset X$$ $Y\subset X$is an irreducible analytic subset of dimensionm, we consider the space$$H^0_0 (X|Y, L^p)$$ $H_0^0\left(X\right|Y,L^p)$of holomorphic sections of$$L^p|_Y$$ $L^p{|}_Y$that extend to global holomorphic sections in$$H^0_0(X,L^p)$$ $H_0^0(X,L^p)$. Assuming that the triplet$$(L,\Sigma ,\tau )$$ $(L,\Sigma ,\tau )$is big in the sense that$$\dim H^0_0(X,L^p)\sim p^n$$ $dim{H}_0^0(X,L^p)\sim p^n$, we give a general condition onYto ensure that$$\dim H^0_0(X|Y,L^p)\sim p^m$$ $dim{H}_0^0\left(X\right|Y,L^p)\sim p^m$. WhenLis endowed with a continuous Hermitian metric, we show that the Fubini-Study currents of the spaces$$H^0_0(X|Y,L^p)$$ $H_0^0\left(X\right|Y,L^p)$converge to a certain equilibrium current onY. We apply this to the study of the equidistribution of zeros inYof random holomorphic sections in$$H^0_0(X|Y,L^p)$$ $H_0^0\left(X\right|Y,L^p)$as$$p\rightarrow \infty $$ $p\to \infty$. 

   more » « less
4. Partitioned matching games for international kidney exchange

   https://doi.org/10.1007/s10107-025-02200-9  

   Benedek, Márton; Biró, Péter; Kern, Walter; Pálvölgyi, Dömötör; Paulusma, Daniel (February 2025, Mathematical Programming)

   Abstract We introduce partitioned matching games as a suitable model for international kidney exchange programmes, where in each round the total number of available kidney transplants needs to be distributed amongst the participating countries in a “fair” way. A partitioned matching game (N, v) is defined on a graph$$G=(V,E)$$ $G=(V,E)$with an edge weightingwand a partition$$V=V_1 \cup \dots \cup V_n$$ $V=V_1\cup \cdots \cup V_n$. The player set is$$N = \{ 1, \dots , n\}$$ $N=\{1,\cdots ,n\}$, and player$$p \in N$$ $p\in N$owns the vertices in$$V_p$$ $V_p$. The valuev(S) of a coalition $$S \subseteq N$$ $S\subseteq N$is the maximum weight of a matching in the subgraph ofGinduced by the vertices owned by the players in S. If$$|V_p|=1$$ $|V_p|=1$for all$$p\in N$$ $p\in N$, then we obtain the classical matching game. Let$$c=\max \{|V_p| \; |\; 1\le p\le n\}$$ $c=max\left\{\right|V_p\left|\right|1\le p\le n\}$be the width of (N, v). We prove that checking core non-emptiness is polynomial-time solvable if$$c\le 2$$ $c\le 2$but co--hard if$$c\le 3$$ $c\le 3$. We do this via pinpointing a relationship with the known class ofb-matching games and completing the complexity classification on testing core non-emptiness forb-matching games. With respect to our application, we prove a number of complexity results on choosing, out of possibly many optimal solutions, one that leads to a kidney transplant distribution that is as close as possible to some prescribed fair distribution. 

   more » « less
5. Abelian varieties of prescribed order over finite fields

   https://doi.org/10.1007/s00208-024-03084-4  

   van_Bommel, Raymond; Costa, Edgar; Li, Wanlin; Poonen, Bjorn; Smith, Alexander (March 2025, Mathematische Annalen)

   Abstract Given a prime powerqand$$n \gg 1$$ $n\gg 1$, we prove that every integer in a large subinterval of the Hasse–Weil interval$$[(\sqrt{q}-1)^{2n},(\sqrt{q}+1)^{2n}]$$ $[{(\sqrt{q}-1)}^{2n},{(\sqrt{q}+1)}^{2n}]$is$$\#A({\mathbb {F}}_q)$$ $\#A\left(F_q\right)$for some ordinary geometrically simple principally polarized abelian varietyAof dimensionnover$${\mathbb {F}}_q$$ $F_q$. As a consequence, we generalize a result of Howe and Kedlaya for$${\mathbb {F}}_2$$ $F_2$to show that for each prime powerq, every sufficiently large positive integer is realizable, i.e.,$$\#A({\mathbb {F}}_q)$$ $\#A\left(F_q\right)$for some abelian varietyAover$${\mathbb {F}}_q$$ $F_q$. Our result also improves upon the best known constructions of sequences of simple abelian varieties with point counts towards the extremes of the Hasse–Weil interval. A separate argument determines, for fixedn, the largest subinterval of the Hasse–Weil interval consisting of realizable integers, asymptotically as$$q \rightarrow \infty $$ $q\to \infty$; this gives an asymptotically optimal improvement of a 1998 theorem of DiPippo and Howe. Our methods are effective: We prove that if$$q \le 5$$ $q\le 5$, then every positive integer is realizable, and for arbitraryq, every positive integer$$\ge q^{3 \sqrt{q} \log q}$$ $\ge q^{3\sqrt{q}logq}$is realizable. 

   more » « less