105 citations
- Tel Aviv UniversityIL37 papers
- Massachusetts Institute of TechnologyUS11 papers
- Columbia UniversityUS10 papers
- Argonne National LaboratoryUS9 papers
- Duke UniversityUS9 papers
- Istituto Nazionale di Fisica NucleareIT9 papers
- Rutgers, The State University of New JerseyUS9 papers
- Stony Brook UniversityUS9 papers
- Syracuse UniversityUS9 papers
- University of California, BerkeleyUS9 papers
- University of PennsylvaniaUS9 papers
- Virginia TechUS9 papers
92 papers
Central Products of Cayley-Dickson Loops
Adam Chapman, Ilan Levin
This paper studies the triviality of commutators in central products of Cayley-Dickson loops. Two immediate outcomes of this study are (1) the construction of a sequence of non-com…
Quantum-Based Resilient Routing in Networks: Minimizing Latency Under Dual-Link Failures
Maher Harb, Nader Foroughi, Matt Stehman +3
Network optimization problems represent large combinatorial search spaces that grow exponentially with network size, making them computationally intensive to solve. This paper addr…
gPC-based robustness analysis of neural systems through probabilistic recurrence metrics
Uros Sutulovic, Daniele Proverbio, Rami Katz +1
Neuronal systems often preserve their characteristic functions and signalling patterns, also referred to as regimes, despite parametric uncertainties and variations. For neural mod…
On the sizes of the maximal prime powers divisors of factorials
Dan Levy
Let p be any prime, and the maximal power of dividing . It is proved that there exists a positive integer , which depends only on , such that $q^(ν_q(…
Unveiling Affective Polarization Trends in Parliamentary Proceedings
Gili Goldin, Ella Rabinovich, Shuly Wintner
Recent years have seen an increase in polarized discourse worldwide, on various platforms. We propose a novel method for quantifying polarization, based on the emotional style of t…
Monotone Bounded Depth Formula Complexity of Graph Homomorphism Polynomials
Balagopal Komarath, Rohit Narayanan
We introduce baggy elimination trees, a novel graph decomposition that generalises the classical elimination trees underlying treedepth, and use them to give a complete characteris…