Related papers: Some Remarks on Boolean Constraint Propagation
Constrained propagation of massless fields is ubiquitous in physical systems, arising from boundaries, material structure, or other restrictions on admissible modes. This paper shows that such constraints generically induce mass-like terms…
The aim of the present paper is to extend the concept of a congruence from lattices to posets. We use an approach different from that used by the first author and V. Sn\'a\v{s}el. By using our definition we show that congruence classes are…
Motivated by the study of resolvent estimates in the presence of trapping, we prove a semiclassical propagation theorem in a neighborhood of a compact invariant subset of the bicharacteristic flow which is isolated in a suitable sense.…
We consider sequences of random variables whose probability generating functions are polynomials all of whose roots lie on the unit circle. The distribution of such random variables has only been sporadically studied in the literature. We…
We frame the problem of selecting an optimal audio encoding scheme as a supervised learning task. Through uniform convergence theory, we guarantee approximately optimal codec selection while controlling for selection bias. We present…
In this work, we study convection-diffusion equations in the cases of bounded drifts and drifts induced by the gradient of a potential. We define a new notion of solution and prove its existence and uniqueness. Furthermore, we show the…
This work's major intention is the investigation of the well-posedness of certain cross-diffusion equations in the class of bounded functions. More precisely, we show existence, uniqueness and stability of bounded weak solutions under the…
In this paper, we study a class of equations representing nonlinear diffusion on networks. A particular instance of our model can be seen as a network equivalent of the porous-medium equation. We are interested in studying perturbations of…
We provide experimental evaluation of a number of known and new algorithms for approximate computation of Monroe's and Chamberlin-Courant's rules. Our experiments, conducted both on real-life preference-aggregation data and on synthetic…
We study randomized variants of two classical algorithms: coordinate descent for systems of linear equations and iterated projections for systems of linear inequalities. Expanding on a recent randomized iterated projection algorithm of…
We consider networks of reaction-diffusion systems of Hodgkin-Huxley type. We give a general mathematical framework, in which we prove existence and unicity of solutions as well as existence of invariant regions and of the attractor. Then,…
Higher order nets were introduced by Dick as a generalisation of classical $(t,m,s)$-nets, which are point sets frequently used in quasi-Monte Carlo integration algorithms. Essential tools in finding such point sets of high quality are…
We suggest an upper bound on binomial coefficients that holds over the entire parameter range and whose form repeats the form of the de Moivre-Laplace approximation of the symmetric binomial distribution. Using the bound, we estimate the…
We study the propagation of uniformly translating fronts into a linearly unstable state, both analytically and numerically. We introduce a perturbative renormalization group (RG) approach to compute the change in the propagation speed when…
In this paper we study several monotonicity axioms in approval-based multi-winner voting rules. We consider monotonicity with respect to the support received by the winners and also monotonicity in the size of the committee. Monotonicity…
In linear optics, photons are scattered in a network through passive optical elements including beamsplitters and phase shifters, leading to many intriguing applications in physics, such as Mach-Zehnder interferometry, Hong-Ou-Mandel…
The effect of Richard T. Cox's contribution to probability theory was to generalize Boolean implication among logical statements to degrees of implication, which are manipulated using rules derived from consistency with Boolean algebra.…
Prolog is a well known declarative programming language based on propositional Horn formulas. It is useful in various areas, including artificial intelligence, automated theorem proving, mathematical logic and so on. An active research area…
This paper establishes some equivalent conditions of a uninorm, extending an arbitrary triangular norm on [0, e] or an arbitrary triangular conorm on [e, 1] to the whole lattice.
In Constraint Programming, solving discrete minimization problems with hard and soft constraints can be done either using (i) soft global constraints, (ii) a reformulation into a linear program, or (iii) a reformulation into local cost…