A Global Version Of The Darboux Theorem With Optimal Regularity And Dirichlet Condition

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Technology mapping transforms a technology-independent representation into a technology-dependent one given a library of cells. This process is performed by means of local replacements that are extracted by matching sections of the subject graph to library ...

By juxtaposing ideas from fractal geometry and dynamical systems, Furstenberg proposed a series of conjectures in the late 1960's that explore the relationship between digit expansions with respect to multiplicatively independent bases. In this work, we in ...

Molecular quantum dynamics simulations are essential for understanding many fundamental phenomena in physics and chemistry. They often require solving the time-dependent Schrödinger equation for molecular nuclei, which is challenging even for medium-sized ...

We study the hitting probabilities of the solution to a system of d stochastic heat equations with additive noise subject to Dirichlet boundary conditions. We show that for any bounded Borel set with positive (d-6)\documentclass[12pt]{minimal} \usepackage{ ...

We consider nonlinear parabolic stochastic PDEs on a bounded Lipschitz domain driven by a Gaussian noise that is white in time and colored in space, with Dirichlet or Neumann boundary condition. We establish existence, uniqueness and moment bounds of the r ...

Factored form is a powerful multi-level representation of a Boolean function that readily translates into an implementation of the function in CMOS technology. In particular, the number of literals in a factored form correlates strongly with the number of ...

Among the single-trajectory Gaussian-based methods for solving the time-dependent Schrödinger equation, the variational Gaussian approximation is the most accurate one. In contrast to Heller’s original thawed Gaussian approximation, it is symplectic, conse ...

In this paper, we consider the first eigenvalue.1(O) of the Grushin operator.G :=.x1 + |x1|2s.x2 with Dirichlet boundary conditions on a bounded domain O of Rd = R d1+ d2. We prove that.1(O) admits a unique minimizer in the class of domains with prescribed ...

We study the symplectic Howe duality using two new and independent combinatorial methods: via determinantal formulae on the one hand, and via (bi)crystals on the other hand. The first approach allows us to establish a generalised version where weight multi ...

In this thesis, we propose model order reduction techniques for high-dimensional PDEs that preserve structures of the original problems and develop a closure modeling framework leveraging the Mori-Zwanzig formalism and recurrent neural networks. Since high ...

This work proposes an adaptive structure-preserving model order reduction method for finite-dimensional parametrized Hamiltonian systems modeling non-dissipative phenomena. To overcome the slowly decaying Kolmogorov width typical of transport problems, the ...

In this article, motivated by the study of symplectic structures on manifolds with boundary and the systematic study of b-symplectic manifolds started in Guillemin, Miranda, and Pires Adv. Math. 264 (2014), 864-896, we prove a slice theorem for Lie group a ...

Modern manufacturing engineering is based on a ``design-through-analysis'' workflow. According to this paradigm, a prototype is first designed with Computer-aided-design (CAD) software and then finalized by simulating its physical behavior, which usually i ...

We propose a new approach for normalization and simplification of logical formulas. Our approach is based on algorithms for lattice-like structures. Specifically, we present two efficient algorithms for computing a normal form and deciding the word problem ...

We present a quasilinear time algorithm to decide the word problem on a natural algebraic structures we call orthocomplemented bisemilattices, a subtheory of boolean algebra. We use as a base a variation of Hopcroft, Ullman and Aho algorithm for tree isomo ...

We develop structure-preserving reduced basis methods for a large class of nondissipative problems by resorting to their formulation as Hamiltonian dynamical systems. With this perspective, the phase space is naturally endowed with a Poisson manifold struc ...

We show that computing the majority of n copies of a boolean function g has randomised query complexity R(Maj∘gⁿ) = Θ(n⋅R ̅_{1/n}(g)). In fact, we show that to obtain a similar result for any composed function f∘gⁿ, it suffices to prove a sufficiently stro ...

Most logic synthesis algorithms work on graph representations of logic functions with nodes associated with arbitrary logic expressions or simple logic functions and iteratively optimize such graphs. While recent multilevel logic synthesis efforts focused ...

Logic resynthesis is the problem of finding a dependency function to re-express a given Boolean function in terms of a given set of divisor functions. In this paper, we study logic resynthesis of majority-based circuits, which is motivated by the increasin ...

Many natural optimization problems are NP-hard, which implies that they are probably hard to solve exactly in the worst-case. However, it suffices to get reasonably good solutions for all (or even most) instances in practice. This paper presents a new algo ...

A Global Version Of The Darboux Theorem With Optimal Regularity And Dirichlet Condition

Chat with Graph Search

In Medio Stat Virtus: Combining Boolean and Pattern Matching

Additive and geometric transversality of fractal sets in the integers

High-order geometric integrators for the variational Gaussian wavepacket dynamics and application to vibronic spectra at finite temperature

Hitting with Probability One for Stochastic Heat Equations with Additive Noise

Parabolic stochastic PDEs on bounded domains with rough initial conditions: moment and correlation bounds

Improving Standard-Cell Design Flow using Factored Form Optimization

High-order geometric integrators for the variational Gaussian approximation

The first Grushin eigenvalue on cartesian product domains

Generalised Howe duality and injectivity of induction: the symplectic case

Structure-preserving approaches and data-driven closure modeling for model order reduction

Rank-adaptive structure-preserving model order reduction of Hamiltonian systems

A b-symplectic slice theorem

Stabilized isogeometric discretizations on trimmed and union geometries, and weak imposition of the boundary conditions for the Darcy flow

Formula Normalizations in Verification

Equivalence Checking for Orthocomplemented Bisemilattices in Log-Linear Time

Structure-Preserving Reduced Basis Methods For Poisson Systems

A Majority Lemma for Randomised Query Complexity

Three-Input Gates for Logic Synthesis

Logic Resynthesis of Majority-Based Circuits by Top-Down Decomposition

Learning from survey propagation: a neural network for MAX-E-3-SAT